./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 f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/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_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX --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-f8e1c90 [2021-11-09 09:42:21,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:42:21,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:42:21,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:42:21,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:42:21,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:42:21,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:42:21,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:42:21,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:42:21,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:42:21,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:42:21,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:42:21,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:42:21,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:42:21,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:42:21,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:42:21,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:42:21,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:42:21,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:42:21,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:42:21,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:42:21,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:42:21,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:42:21,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:42:21,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:42:21,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:42:21,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:42:21,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:42:21,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:42:21,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:42:21,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:42:21,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:42:21,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:42:21,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:42:21,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:42:21,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:42:21,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:42:21,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:42:21,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:42:21,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:42:21,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:42:21,884 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-09 09:42:21,946 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:42:21,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:42:21,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:42:21,950 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:42:21,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:42:21,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:42:21,953 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:42:21,954 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-09 09:42:21,954 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-09 09:42:21,954 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-09 09:42:21,956 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-09 09:42:21,957 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-09 09:42:21,957 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-09 09:42:21,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:42:21,958 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 09:42:21,958 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-09 09:42:21,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 09:42:21,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 09:42:21,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:42:21,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-09 09:42:21,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-09 09:42:21,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-09 09:42:21,960 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 09:42:21,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 09:42:21,961 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-09 09:42:21,961 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:42:21,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-09 09:42:21,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:42:21,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:42:21,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:42:21,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 09:42:21,966 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:42:21,967 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-09 09:42:21,967 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_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/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_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX 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-09 09:42:22,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:42:22,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:42:22,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:42:22,416 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:42:22,418 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:42:22,419 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i [2021-11-09 09:42:22,512 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/data/e2897f1d3/6e9b8553e66c4350b8558dfbf99a8bb1/FLAG077787097 [2021-11-09 09:42:23,212 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:42:23,213 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/sv-benchmarks/c/array-memsafety/openbsd_cstrlcpy-alloca-1.i [2021-11-09 09:42:23,250 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/data/e2897f1d3/6e9b8553e66c4350b8558dfbf99a8bb1/FLAG077787097 [2021-11-09 09:42:23,477 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/data/e2897f1d3/6e9b8553e66c4350b8558dfbf99a8bb1 [2021-11-09 09:42:23,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:42:23,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 09:42:23,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:42:23,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:42:23,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:42:23,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:42:23" (1/1) ... [2021-11-09 09:42:23,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492968e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:23, skipping insertion in model container [2021-11-09 09:42:23,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:42:23" (1/1) ... [2021-11-09 09:42:23,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:42:23,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:42:24,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:42:24,040 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:42:24,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:42:24,154 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:42:24,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:24 WrapperNode [2021-11-09 09:42:24,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:42:24,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 09:42:24,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 09:42:24,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 09:42:24,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:24" (1/1) ... [2021-11-09 09:42:24,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:24" (1/1) ... [2021-11-09 09:42:24,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 09:42:24,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:42:24,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:42:24,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:42:24,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:24" (1/1) ... [2021-11-09 09:42:24,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:24" (1/1) ... [2021-11-09 09:42:24,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:24" (1/1) ... [2021-11-09 09:42:24,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:24" (1/1) ... [2021-11-09 09:42:24,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:24" (1/1) ... [2021-11-09 09:42:24,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:24" (1/1) ... [2021-11-09 09:42:24,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:24" (1/1) ... [2021-11-09 09:42:24,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:42:24,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:42:24,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:42:24,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:42:24,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:24" (1/1) ... [2021-11-09 09:42:24,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:24,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:24,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:24,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-09 09:42:24,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-09 09:42:24,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-09 09:42:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:42:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-09 09:42:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:42:24,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:42:24,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:42:24,875 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-09 09:42:24,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:42:24 BoogieIcfgContainer [2021-11-09 09:42:24,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:42:24,880 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-09 09:42:24,880 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-09 09:42:24,885 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-09 09:42:24,886 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-09 09:42:24,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 09:42:23" (1/3) ... [2021-11-09 09:42:24,888 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@513cb723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 09:42:24, skipping insertion in model container [2021-11-09 09:42:24,888 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-09 09:42:24,889 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:42:24" (2/3) ... [2021-11-09 09:42:24,889 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@513cb723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 09:42:24, skipping insertion in model container [2021-11-09 09:42:24,889 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-09 09:42:24,890 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:42:24" (3/3) ... [2021-11-09 09:42:24,892 INFO L389 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca-1.i [2021-11-09 09:42:24,944 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-09 09:42:24,945 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-09 09:42:24,945 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-09 09:42:24,945 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-09 09:42:24,946 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-09 09:42:24,946 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-09 09:42:24,946 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-09 09:42:24,947 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-09 09:42:24,966 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-09 09:42:24,986 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2021-11-09 09:42:24,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:24,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:24,994 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-09 09:42:24,995 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:24,995 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-09 09:42:24,996 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-09 09:42:24,999 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2021-11-09 09:42:24,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:24,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:25,000 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-09 09:42:25,000 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:25,008 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 22#L536true assume !(main_~length~0 < 1); 8#L536-2true assume !(main_~n~1 < 1); 9#L539-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 5#L545-3true [2021-11-09 09:42:25,009 INFO L793 eck$LassoCheckResult]: Loop: 5#L545-3true assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 11#L545-2true main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 5#L545-3true [2021-11-09 09:42:25,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:25,016 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2021-11-09 09:42:25,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:25,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384193700] [2021-11-09 09:42:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:25,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:25,163 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:25,217 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:25,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2021-11-09 09:42:25,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:25,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539104150] [2021-11-09 09:42:25,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:25,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:25,239 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:25,251 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:25,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2021-11-09 09:42:25,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:25,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441558101] [2021-11-09 09:42:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:25,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:25,288 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:25,323 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:25,922 INFO L210 LassoAnalysis]: Preferences: [2021-11-09 09:42:25,922 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-09 09:42:25,939 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-09 09:42:25,939 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-09 09:42:25,939 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-09 09:42:25,940 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:25,940 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-09 09:42:25,940 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-09 09:42:25,940 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-1.i_Iteration1_Lasso [2021-11-09 09:42:25,941 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-09 09:42:25,941 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-09 09:42:25,968 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-09 09:42:25,975 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-09 09:42:25,978 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-09 09:42:25,982 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-09 09:42:25,986 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-09 09:42:25,990 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-09 09:42:25,994 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-09 09:42:25,998 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-09 09:42:26,001 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-09 09:42:26,006 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-09 09:42:26,009 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-09 09:42:26,014 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-09 09:42:26,017 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-09 09:42:26,020 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-09 09:42:26,027 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-09 09:42:26,572 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-09 09:42:26,581 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-09 09:42:26,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:26,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:26,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:26,600 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-09 09:42:26,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:26,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:26,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:26,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:26,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:26,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:26,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:26,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-09 09:42:26,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:26,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:26,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:26,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:26,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:26,696 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-09 09:42:26,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:26,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:26,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:26,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:26,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:26,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:26,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:26,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-09 09:42:26,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:26,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:26,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:26,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:26,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:26,772 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-09 09:42:26,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:26,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:26,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:26,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:26,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:26,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:26,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-09 09:42:26,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:26,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:26,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:26,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:26,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:26,856 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-09 09:42:26,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:26,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:26,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:26,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:26,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:26,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:26,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-09 09:42:26,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:26,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-11-09 09:42:26,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:26,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:26,919 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:26,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-09 09:42:26,921 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-09 09:42:26,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:26,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:26,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:26,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:26,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:26,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:26,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:26,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:26,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:26,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:26,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:26,986 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:26,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-09 09:42:26,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-09 09:42:27,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:27,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:27,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:27,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:27,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:27,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:27,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:27,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:27,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:27,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:27,062 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:27,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-09 09:42:27,075 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-09 09:42:27,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:27,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:27,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:27,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:27,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:27,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:27,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:27,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:27,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:27,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:27,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:27,132 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:27,152 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-09 09:42:27,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:27,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:27,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:27,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:27,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:27,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:27,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:27,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-09 09:42:27,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:27,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:27,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:27,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:27,228 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:27,235 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-09 09:42:27,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:27,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:27,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:27,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:27,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:27,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:27,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-09 09:42:27,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:27,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:27,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:27,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:27,297 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:27,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-11-09 09:42:27,304 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-09 09:42:27,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:27,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:27,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:27,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:27,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:27,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:27,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:27,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:27,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:27,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:27,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:27,353 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:27,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-11-09 09:42:27,355 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-09 09:42:27,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:27,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:27,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:27,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:27,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:27,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:27,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:27,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:27,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:27,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:27,435 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:27,439 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-09 09:42:27,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-11-09 09:42:27,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:27,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:27,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:27,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:27,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:27,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:27,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:27,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:27,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:27,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:27,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:27,519 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:27,527 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-09 09:42:27,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:27,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:27,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:27,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:27,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:27,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:27,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:27,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-11-09 09:42:27,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:27,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-11-09 09:42:27,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:27,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:27,576 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:27,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-11-09 09:42:27,578 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-09 09:42:27,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:27,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:27,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:27,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:27,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:27,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:27,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:27,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:27,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:27,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:27,654 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:27,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-11-09 09:42:27,667 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-09 09:42:27,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:27,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:27,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:27,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:27,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:27,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:27,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:27,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:27,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:27,740 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:27,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:27,743 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:27,750 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-09 09:42:27,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-11-09 09:42:27,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:27,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:27,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:27,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:27,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:27,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:27,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:27,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:27,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:27,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:27,820 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:27,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-11-09 09:42:27,821 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-09 09:42:27,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:27,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:27,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:27,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:27,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:27,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:27,867 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-09 09:42:27,925 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2021-11-09 09:42:27,926 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-11-09 09:42:27,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:27,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:27,936 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:27,979 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-09 09:42:27,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-11-09 09:42:28,017 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-11-09 09:42:28,017 INFO L513 LassoAnalysis]: Proved termination. [2021-11-09 09:42:28,018 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [1*ULTIMATE.start_main_~nondetString2~0.offset >= 0] [2021-11-09 09:42:28,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:28,139 INFO L297 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2021-11-09 09:42:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:28,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-09 09:42:28,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:28,277 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-09 09:42:28,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:28,330 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-09 09:42:28,359 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-09 09:42:28,361 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-09 09:42:28,499 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 57 states and 90 transitions. Complement of second has 8 states. [2021-11-09 09:42:28,500 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-09 09:42:28,502 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-09 09:42:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2021-11-09 09:42:28,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 5 letters. Loop has 2 letters. [2021-11-09 09:42:28,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 09:42:28,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 7 letters. Loop has 2 letters. [2021-11-09 09:42:28,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 09:42:28,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 5 letters. Loop has 4 letters. [2021-11-09 09:42:28,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 09:42:28,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 90 transitions. [2021-11-09 09:42:28,514 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-11-09 09:42:28,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 20 states and 29 transitions. [2021-11-09 09:42:28,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-11-09 09:42:28,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-11-09 09:42:28,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2021-11-09 09:42:28,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:28,523 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-11-09 09:42:28,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2021-11-09 09:42:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-09 09:42:28,561 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-09 09:42:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2021-11-09 09:42:28,569 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-11-09 09:42:28,569 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2021-11-09 09:42:28,569 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-09 09:42:28,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2021-11-09 09:42:28,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-11-09 09:42:28,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:28,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:28,575 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:28,576 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:28,577 INFO L791 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 168#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 179#L536 assume !(main_~length~0 < 1); 171#L536-2 assume !(main_~n~1 < 1); 172#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 163#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 164#L545-4 main_~i~1 := 0; 175#L550-3 [2021-11-09 09:42:28,577 INFO L793 eck$LassoCheckResult]: Loop: 175#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 176#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 175#L550-3 [2021-11-09 09:42:28,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:28,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2021-11-09 09:42:28,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:28,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109771740] [2021-11-09 09:42:28,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:28,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:28,607 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:28,636 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:28,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2021-11-09 09:42:28,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:28,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421730728] [2021-11-09 09:42:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:28,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:28,665 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:28,677 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:28,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2021-11-09 09:42:28,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:28,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551064239] [2021-11-09 09:42:28,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:28,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:28,703 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:28,727 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:29,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:29,252 INFO L210 LassoAnalysis]: Preferences: [2021-11-09 09:42:29,252 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-09 09:42:29,252 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-09 09:42:29,252 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-09 09:42:29,252 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-09 09:42:29,252 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:29,252 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-09 09:42:29,253 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-09 09:42:29,253 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-1.i_Iteration2_Lasso [2021-11-09 09:42:29,253 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-09 09:42:29,253 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-09 09:42:29,264 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-09 09:42:29,269 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-09 09:42:29,272 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-09 09:42:29,279 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-09 09:42:29,284 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-09 09:42:29,287 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-09 09:42:29,291 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-09 09:42:29,294 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-09 09:42:29,297 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-09 09:42:29,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-09 09:42:29,302 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-09 09:42:29,305 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-09 09:42:29,493 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-09 09:42:29,496 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-09 09:42:29,819 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-09 09:42:29,819 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-09 09:42:29,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:29,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:29,824 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:29,837 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-09 09:42:29,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:29,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:29,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:29,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:29,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:29,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:29,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:29,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-11-09 09:42:29,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:29,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:29,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:29,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:29,903 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:29,914 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-09 09:42:29,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-11-09 09:42:29,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:29,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:29,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:29,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:29,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:29,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:29,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:29,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:29,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:29,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:29,997 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:29,999 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-09 09:42:30,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:30,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:30,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:30,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:30,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:30,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:30,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-11-09 09:42:30,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:30,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:30,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:30,081 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:30,084 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-09 09:42:30,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:30,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:30,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:30,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:30,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:30,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:30,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:30,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-11-09 09:42:30,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:30,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:30,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:30,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:30,149 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:30,151 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-09 09:42:30,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:30,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:30,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:30,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:30,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:30,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:30,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-11-09 09:42:30,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:30,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:30,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:30,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:30,227 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:30,230 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-09 09:42:30,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:30,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:30,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:30,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:30,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:30,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:30,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-11-09 09:42:30,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:30,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:30,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:30,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:30,313 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:30,316 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-09 09:42:30,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:30,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:30,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:30,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:30,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:30,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:30,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-11-09 09:42:30,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:30,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:30,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:30,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:30,391 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:30,394 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-09 09:42:30,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:30,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:30,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:30,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:30,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:30,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:30,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:30,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-11-09 09:42:30,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:30,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:30,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:30,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:30,469 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:30,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-09 09:42:30,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:30,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:30,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:30,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:30,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:30,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:30,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:30,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-11-09 09:42:30,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:30,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:30,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:30,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:30,538 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:30,542 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-09 09:42:30,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:30,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:30,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:30,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:30,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:30,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:30,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:30,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-11-09 09:42:30,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:30,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:30,613 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:30,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:30,615 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:30,620 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-09 09:42:30,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:30,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:30,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:30,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:30,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:30,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:30,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:30,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-11-09 09:42:30,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:30,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:30,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:30,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:30,687 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:30,692 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-09 09:42:30,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:30,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:30,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:30,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:30,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:30,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:30,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:30,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-11-09 09:42:30,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:30,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:30,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:30,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:30,765 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:30,769 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-09 09:42:30,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:30,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:30,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:30,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:30,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:30,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:30,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-11-09 09:42:30,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:30,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:30,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:30,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:30,849 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:30,851 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-09 09:42:30,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:30,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:30,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:30,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:30,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:30,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:30,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-11-09 09:42:30,908 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-09 09:42:30,943 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2021-11-09 09:42:30,943 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-11-09 09:42:30,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:30,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:30,946 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:30,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-11-09 09:42:30,952 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-09 09:42:30,980 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-09 09:42:30,980 INFO L513 LassoAnalysis]: Proved termination. [2021-11-09 09:42:30,980 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~n~1) = -1*ULTIMATE.start_main_~i~1 + 1*ULTIMATE.start_main_~n~1 Supporting invariants [] [2021-11-09 09:42:31,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:31,033 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-11-09 09:42:31,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:31,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-09 09:42:31,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:31,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-09 09:42:31,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:31,131 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-09 09:42:31,133 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-09 09:42:31,134 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-09 09:42:31,198 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 6 states. [2021-11-09 09:42:31,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-11-09 09:42:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-09 09:42:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2021-11-09 09:42:31,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2021-11-09 09:42:31,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 09:42:31,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 2 letters. [2021-11-09 09:42:31,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 09:42:31,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 4 letters. [2021-11-09 09:42:31,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 09:42:31,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 48 transitions. [2021-11-09 09:42:31,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-09 09:42:31,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 31 transitions. [2021-11-09 09:42:31,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-11-09 09:42:31,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-11-09 09:42:31,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2021-11-09 09:42:31,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:31,206 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2021-11-09 09:42:31,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2021-11-09 09:42:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-11-09 09:42:31,210 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-09 09:42:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2021-11-09 09:42:31,216 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2021-11-09 09:42:31,216 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2021-11-09 09:42:31,216 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-09 09:42:31,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 31 transitions. [2021-11-09 09:42:31,217 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-09 09:42:31,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:31,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:31,218 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:31,219 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-09 09:42:31,219 INFO L791 eck$LassoCheckResult]: Stem: 292#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 293#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 305#L536 assume !(main_~length~0 < 1); 296#L536-2 assume !(main_~n~1 < 1); 297#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 288#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 289#L545-4 main_~i~1 := 0; 300#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 298#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 299#L519 assume 0 != cstrlcpy_~n~0 % 4294967296; 294#L520-3 [2021-11-09 09:42:31,219 INFO L793 eck$LassoCheckResult]: Loop: 294#L520-3 cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 295#L520-1 assume !!(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, 1 + cstrlcpy_#t~post3.offset;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, 1 + cstrlcpy_#t~post4.offset;call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1);call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); 306#L521 assume !(0 == cstrlcpy_#t~mem5);havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset;havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset;havoc cstrlcpy_#t~mem5; 294#L520-3 [2021-11-09 09:42:31,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:31,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1595220888, now seen corresponding path program 1 times [2021-11-09 09:42:31,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:31,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675064946] [2021-11-09 09:42:31,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:31,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:31,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:31,259 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:31,290 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:31,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:31,291 INFO L85 PathProgramCache]: Analyzing trace with hash 80599, now seen corresponding path program 1 times [2021-11-09 09:42:31,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:31,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715051989] [2021-11-09 09:42:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:31,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:31,308 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:31,323 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:31,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:31,324 INFO L85 PathProgramCache]: Analyzing trace with hash -587605024, now seen corresponding path program 1 times [2021-11-09 09:42:31,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:31,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981168663] [2021-11-09 09:42:31,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:31,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:31,543 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-09 09:42:31,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:31,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981168663] [2021-11-09 09:42:31,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981168663] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:42:31,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:42:31,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:42:31,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421019249] [2021-11-09 09:42:31,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:31,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:42:31,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:42:31,741 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-09 09:42:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:31,869 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2021-11-09 09:42:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 09:42:31,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 49 transitions. [2021-11-09 09:42:31,874 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-11-09 09:42:31,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 49 transitions. [2021-11-09 09:42:31,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-11-09 09:42:31,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-11-09 09:42:31,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 49 transitions. [2021-11-09 09:42:31,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:31,876 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 49 transitions. [2021-11-09 09:42:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 49 transitions. [2021-11-09 09:42:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2021-11-09 09:42:31,883 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-09 09:42:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2021-11-09 09:42:31,885 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2021-11-09 09:42:31,885 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2021-11-09 09:42:31,885 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-09 09:42:31,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2021-11-09 09:42:31,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-09 09:42:31,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:31,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:31,887 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:31,888 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-09 09:42:31,888 INFO L791 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 368#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 384#L536 assume !(main_~length~0 < 1); 371#L536-2 assume !(main_~n~1 < 1); 373#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 363#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 364#L545-4 main_~i~1 := 0; 389#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 381#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 380#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 374#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 375#L519 assume 0 != cstrlcpy_~n~0 % 4294967296; 369#L520-3 [2021-11-09 09:42:31,888 INFO L793 eck$LassoCheckResult]: Loop: 369#L520-3 cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 370#L520-1 assume !!(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, 1 + cstrlcpy_#t~post3.offset;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, 1 + cstrlcpy_#t~post4.offset;call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1);call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); 385#L521 assume !(0 == cstrlcpy_#t~mem5);havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset;havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset;havoc cstrlcpy_#t~mem5; 369#L520-3 [2021-11-09 09:42:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash -294332618, now seen corresponding path program 1 times [2021-11-09 09:42:31,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:31,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95821869] [2021-11-09 09:42:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:31,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:31,923 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:31,978 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:31,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash 80599, now seen corresponding path program 2 times [2021-11-09 09:42:31,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:31,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135660711] [2021-11-09 09:42:31,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:31,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:31,995 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:32,024 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:32,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:32,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1860246402, now seen corresponding path program 1 times [2021-11-09 09:42:32,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:32,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241233145] [2021-11-09 09:42:32,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:32,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:32,248 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-09 09:42:32,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:32,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241233145] [2021-11-09 09:42:32,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241233145] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:42:32,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:42:32,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 09:42:32,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575055783] [2021-11-09 09:42:32,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:32,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:42:32,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:42:32,414 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-09 09:42:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:32,523 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2021-11-09 09:42:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 09:42:32,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 73 transitions. [2021-11-09 09:42:32,526 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-11-09 09:42:32,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 73 transitions. [2021-11-09 09:42:32,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2021-11-09 09:42:32,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2021-11-09 09:42:32,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 73 transitions. [2021-11-09 09:42:32,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:32,530 INFO L681 BuchiCegarLoop]: Abstraction has 55 states and 73 transitions. [2021-11-09 09:42:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 73 transitions. [2021-11-09 09:42:32,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2021-11-09 09:42:32,535 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-09 09:42:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2021-11-09 09:42:32,536 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-11-09 09:42:32,536 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-11-09 09:42:32,536 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-09 09:42:32,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. [2021-11-09 09:42:32,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-09 09:42:32,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:32,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:32,538 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:32,538 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:32,539 INFO L791 eck$LassoCheckResult]: Stem: 469#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 470#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 487#L536 assume !(main_~length~0 < 1); 473#L536-2 assume main_~n~1 < 1;main_~n~1 := 1; 474#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 465#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 466#L545-4 main_~i~1 := 0; 481#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 477#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 478#L519 assume 0 != cstrlcpy_~n~0 % 4294967296; 471#L520-3 cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 472#L520-1 assume !(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2; 489#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 490#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 485#L528-2 [2021-11-09 09:42:32,539 INFO L793 eck$LassoCheckResult]: Loop: 485#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 486#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 485#L528-2 [2021-11-09 09:42:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:32,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1736952706, now seen corresponding path program 1 times [2021-11-09 09:42:32,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:32,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836314438] [2021-11-09 09:42:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:32,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:32,615 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-09 09:42:32,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:32,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836314438] [2021-11-09 09:42:32,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836314438] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:42:32,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:42:32,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:42:32,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848916940] [2021-11-09 09:42:32,616 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:32,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:32,617 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 1 times [2021-11-09 09:42:32,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:32,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913918062] [2021-11-09 09:42:32,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:32,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:32,625 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:32,631 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:32,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:32,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:42:32,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:42:32,684 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. cyclomatic complexity: 22 Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-09 09:42:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:32,755 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2021-11-09 09:42:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:42:32,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2021-11-09 09:42:32,757 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-11-09 09:42:32,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 64 transitions. [2021-11-09 09:42:32,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2021-11-09 09:42:32,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2021-11-09 09:42:32,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2021-11-09 09:42:32,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:32,761 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2021-11-09 09:42:32,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2021-11-09 09:42:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2021-11-09 09:42:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 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-09 09:42:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2021-11-09 09:42:32,770 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-11-09 09:42:32,770 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-11-09 09:42:32,770 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-09 09:42:32,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 62 transitions. [2021-11-09 09:42:32,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-09 09:42:32,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:32,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:32,772 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:32,772 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:32,773 INFO L791 eck$LassoCheckResult]: Stem: 567#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 568#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 584#L536 assume !(main_~length~0 < 1); 571#L536-2 assume main_~n~1 < 1;main_~n~1 := 1; 572#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 574#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 589#L545-4 main_~i~1 := 0; 577#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 578#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 599#L519 assume 0 != cstrlcpy_~n~0 % 4294967296; 598#L520-3 cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 597#L520-1 assume !(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2; 590#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 587#L526 assume 0 != cstrlcpy_~siz % 4294967296;call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); 582#L528-2 [2021-11-09 09:42:32,773 INFO L793 eck$LassoCheckResult]: Loop: 582#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 583#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 582#L528-2 [2021-11-09 09:42:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1736952708, now seen corresponding path program 1 times [2021-11-09 09:42:32,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:32,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959722295] [2021-11-09 09:42:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:32,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:32,807 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:32,833 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:32,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:32,837 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 2 times [2021-11-09 09:42:32,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:32,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148532748] [2021-11-09 09:42:32,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:32,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:32,844 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:32,853 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:32,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:32,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1530728321, now seen corresponding path program 1 times [2021-11-09 09:42:32,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:32,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788292605] [2021-11-09 09:42:32,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:32,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:33,072 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-09 09:42:33,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:33,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788292605] [2021-11-09 09:42:33,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788292605] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:42:33,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:42:33,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:42:33,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228226737] [2021-11-09 09:42:33,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:33,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 09:42:33,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:42:33,131 INFO L87 Difference]: Start difference. First operand 46 states and 62 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-09 09:42:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:33,248 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2021-11-09 09:42:33,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 09:42:33,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2021-11-09 09:42:33,250 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2021-11-09 09:42:33,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 52 states and 65 transitions. [2021-11-09 09:42:33,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-11-09 09:42:33,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-11-09 09:42:33,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 65 transitions. [2021-11-09 09:42:33,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:33,252 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 65 transitions. [2021-11-09 09:42:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 65 transitions. [2021-11-09 09:42:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2021-11-09 09:42:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 45 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-09 09:42:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2021-11-09 09:42:33,256 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2021-11-09 09:42:33,256 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2021-11-09 09:42:33,256 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-09 09:42:33,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2021-11-09 09:42:33,257 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-09 09:42:33,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:33,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:33,257 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:33,257 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-09 09:42:33,258 INFO L791 eck$LassoCheckResult]: Stem: 697#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 698#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 713#L536 assume !(main_~length~0 < 1); 701#L536-2 assume !(main_~n~1 < 1); 703#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 704#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 720#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 721#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 722#L545-4 main_~i~1 := 0; 737#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 733#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 732#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 730#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 727#L519 assume 0 != cstrlcpy_~n~0 % 4294967296; 728#L520-3 [2021-11-09 09:42:33,258 INFO L793 eck$LassoCheckResult]: Loop: 728#L520-3 cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 738#L520-1 assume !!(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, 1 + cstrlcpy_#t~post3.offset;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, 1 + cstrlcpy_#t~post4.offset;call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1);call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); 734#L521 assume !(0 == cstrlcpy_#t~mem5);havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset;havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset;havoc cstrlcpy_#t~mem5; 728#L520-3 [2021-11-09 09:42:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1313217428, now seen corresponding path program 1 times [2021-11-09 09:42:33,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:33,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186076676] [2021-11-09 09:42:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:33,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:33,272 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:33,288 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash 80599, now seen corresponding path program 3 times [2021-11-09 09:42:33,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:33,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959043460] [2021-11-09 09:42:33,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:33,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:33,295 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:33,302 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:33,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash -796650908, now seen corresponding path program 1 times [2021-11-09 09:42:33,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:33,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791947630] [2021-11-09 09:42:33,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:33,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:33,321 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:33,344 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:35,053 INFO L210 LassoAnalysis]: Preferences: [2021-11-09 09:42:35,053 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-09 09:42:35,053 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-09 09:42:35,053 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-09 09:42:35,054 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-09 09:42:35,054 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:35,054 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-09 09:42:35,054 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-09 09:42:35,054 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca-1.i_Iteration7_Lasso [2021-11-09 09:42:35,054 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-09 09:42:35,054 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-09 09:42:35,061 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-09 09:42:35,067 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-09 09:42:35,070 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-09 09:42:35,072 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-09 09:42:35,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-09 09:42:35,077 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-09 09:42:35,079 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-09 09:42:35,081 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-09 09:42:35,085 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-09 09:42:35,088 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-09 09:42:35,090 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-09 09:42:35,093 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-09 09:42:35,095 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-09 09:42:35,099 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-09 09:42:35,101 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-09 09:42:35,104 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-09 09:42:35,106 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-09 09:42:35,108 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-09 09:42:35,109 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-09 09:42:35,111 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-09 09:42:35,113 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-09 09:42:35,115 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-09 09:42:35,117 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-09 09:42:35,120 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-09 09:42:35,122 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-09 09:42:36,644 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-09 09:42:36,644 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-09 09:42:36,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:36,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:36,648 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:36,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-11-09 09:42:36,649 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-09 09:42:36,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:36,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:36,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:36,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:36,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:36,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:36,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:36,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:36,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:36,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:36,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:36,681 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:36,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-11-09 09:42:36,683 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-09 09:42:36,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:36,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:36,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:36,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:36,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:36,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:36,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:36,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:36,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-11-09 09:42:36,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:36,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:36,717 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:36,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-11-09 09:42:36,719 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-09 09:42:36,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:36,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:36,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:36,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:36,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:36,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:36,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:36,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-11-09 09:42:36,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:36,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:36,756 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:36,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-11-09 09:42:36,757 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-09 09:42:36,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:36,765 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:36,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:36,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:36,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:36,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:36,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:36,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:36,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-11-09 09:42:36,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:36,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:36,800 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:36,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-11-09 09:42:36,814 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-09 09:42:36,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:36,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:36,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:36,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:36,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:36,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:36,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:36,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:36,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:36,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:36,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:36,876 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:36,888 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-09 09:42:36,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:36,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:36,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:36,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:36,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:36,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:36,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:36,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-11-09 09:42:36,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:36,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:36,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:36,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:36,951 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:36,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-11-09 09:42:36,957 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-09 09:42:36,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:36,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:36,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:36,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:36,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:36,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:36,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:36,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:36,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-11-09 09:42:36,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:36,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:36,996 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,008 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-09 09:42:37,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-11-09 09:42:37,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:37,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:37,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:37,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-11-09 09:42:37,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,071 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-11-09 09:42:37,073 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-09 09:42:37,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:37,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:37,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-11-09 09:42:37,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,105 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-11-09 09:42:37,106 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-09 09:42:37,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:37,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:37,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:37,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:37,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,135 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-11-09 09:42:37,137 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-09 09:42:37,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:37,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:37,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:37,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:37,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,213 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,227 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-09 09:42:37,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:37,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:37,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:37,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-11-09 09:42:37,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:37,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,299 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,303 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-09 09:42:37,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:37,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:37,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-11-09 09:42:37,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-11-09 09:42:37,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,360 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-11-09 09:42:37,361 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-09 09:42:37,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:37,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:37,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:37,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:37,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,392 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-11-09 09:42:37,394 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-09 09:42:37,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:37,405 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:37,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:37,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,447 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-11-09 09:42:37,451 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-09 09:42:37,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:37,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:37,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:37,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:37,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,484 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,486 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-09 09:42:37,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-11-09 09:42:37,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:37,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:37,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:37,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:37,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,516 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-11-09 09:42:37,518 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-09 09:42:37,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:37,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:37,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:37,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:37,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,547 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-11-09 09:42:37,571 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-09 09:42:37,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:37,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:37,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:37,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:37,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,601 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-11-09 09:42:37,602 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-09 09:42:37,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:37,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:37,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:37,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2021-11-09 09:42:37,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,631 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-11-09 09:42:37,632 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-09 09:42:37,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:37,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:37,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-11-09 09:42:37,663 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,663 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-11-09 09:42:37,665 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-09 09:42:37,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:37,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:37,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:37,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,712 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-11-09 09:42:37,714 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-09 09:42:37,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:37,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:37,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:37,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:37,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,743 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-11-09 09:42:37,744 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-09 09:42:37,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-09 09:42:37,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-09 09:42:37,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-09 09:42:37,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-11-09 09:42:37,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,805 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-11-09 09:42:37,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-09 09:42:37,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:37,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:37,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-11-09 09:42:37,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,852 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-11-09 09:42:37,853 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-09 09:42:37,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:37,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:37,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-11-09 09:42:37,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,934 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-11-09 09:42:37,936 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-09 09:42:37,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:37,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:37,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-09 09:42:37,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-11-09 09:42:37,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:37,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:37,968 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:37,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-11-09 09:42:37,971 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-09 09:42:37,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-09 09:42:37,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-09 09:42:37,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-09 09:42:37,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-09 09:42:37,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-09 09:42:37,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-09 09:42:38,015 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-09 09:42:38,065 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2021-11-09 09:42:38,065 INFO L444 ModelExtractionUtils]: 7 out of 31 variables were initially zero. Simplification set additionally 21 variables to zero. [2021-11-09 09:42:38,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:42:38,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:38,071 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:42:38,075 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-09 09:42:38,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-11-09 09:42:38,107 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-09 09:42:38,108 INFO L513 LassoAnalysis]: Proved termination. [2021-11-09 09:42:38,108 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3 Supporting invariants [] [2021-11-09 09:42:38,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:38,244 INFO L297 tatePredicateManager]: 19 out of 21 supporting invariants were superfluous and have been removed [2021-11-09 09:42:38,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:38,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-09 09:42:38,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:38,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-09 09:42:38,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:38,481 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-09 09:42:38,482 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-09 09:42:38,482 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 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-09 09:42:38,524 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 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 64 states and 83 transitions. Complement of second has 6 states. [2021-11-09 09:42:38,524 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-09 09:42:38,525 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-09 09:42:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-11-09 09:42:38,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 14 letters. Loop has 3 letters. [2021-11-09 09:42:38,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 09:42:38,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 17 letters. Loop has 3 letters. [2021-11-09 09:42:38,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 09:42:38,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 14 letters. Loop has 6 letters. [2021-11-09 09:42:38,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-09 09:42:38,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 83 transitions. [2021-11-09 09:42:38,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:38,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 18 states and 22 transitions. [2021-11-09 09:42:38,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:38,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:38,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2021-11-09 09:42:38,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:38,530 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-09 09:42:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2021-11-09 09:42:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-09 09:42:38,534 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-09 09:42:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-11-09 09:42:38,534 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-09 09:42:38,534 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-09 09:42:38,534 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-09 09:42:38,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2021-11-09 09:42:38,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:38,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:38,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:38,536 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:38,536 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:38,536 INFO L791 eck$LassoCheckResult]: Stem: 972#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 973#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 983#L536 assume !(main_~length~0 < 1); 975#L536-2 assume !(main_~n~1 < 1); 974#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 968#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 969#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 970#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 971#L545-4 main_~i~1 := 0; 980#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 981#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 982#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 976#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 977#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 985#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 984#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 978#L528-2 [2021-11-09 09:42:38,537 INFO L793 eck$LassoCheckResult]: Loop: 978#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 979#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 978#L528-2 [2021-11-09 09:42:38,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash -718415251, now seen corresponding path program 1 times [2021-11-09 09:42:38,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:38,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061876131] [2021-11-09 09:42:38,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:38,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:38,620 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-09 09:42:38,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:38,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061876131] [2021-11-09 09:42:38,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061876131] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:38,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692073194] [2021-11-09 09:42:38,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:38,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:38,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:38,622 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:38,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2021-11-09 09:42:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:38,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-09 09:42:38,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:38,823 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-09 09:42:38,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692073194] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:38,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:38,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2021-11-09 09:42:38,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17787424] [2021-11-09 09:42:38,824 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:38,824 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 3 times [2021-11-09 09:42:38,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:38,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710896975] [2021-11-09 09:42:38,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:38,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:38,828 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:38,831 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:38,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:38,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 09:42:38,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:42:38,874 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 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-09 09:42:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:38,993 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-09 09:42:38,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 09:42:38,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2021-11-09 09:42:38,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:38,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 25 transitions. [2021-11-09 09:42:38,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:38,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:38,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2021-11-09 09:42:38,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:38,996 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-11-09 09:42:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2021-11-09 09:42:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-11-09 09:42:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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-09 09:42:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-11-09 09:42:38,998 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-11-09 09:42:38,998 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-11-09 09:42:38,998 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-09 09:42:38,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2021-11-09 09:42:38,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:39,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:39,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:39,003 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:39,003 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:39,003 INFO L791 eck$LassoCheckResult]: Stem: 1079#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1080#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 1091#L536 assume !(main_~length~0 < 1); 1081#L536-2 assume !(main_~n~1 < 1); 1082#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 1075#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 1076#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1077#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 1078#L545-4 main_~i~1 := 0; 1085#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1086#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1087#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1088#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1094#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 1083#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 1084#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 1093#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 1092#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 1089#L528-2 [2021-11-09 09:42:39,004 INFO L793 eck$LassoCheckResult]: Loop: 1089#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 1090#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 1089#L528-2 [2021-11-09 09:42:39,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:39,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1571238005, now seen corresponding path program 2 times [2021-11-09 09:42:39,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:39,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935224330] [2021-11-09 09:42:39,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:39,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:39,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:39,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935224330] [2021-11-09 09:42:39,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935224330] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:39,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705287604] [2021-11-09 09:42:39,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-09 09:42:39,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:39,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:39,120 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:39,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2021-11-09 09:42:39,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-09 09:42:39,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:42:39,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-09 09:42:39,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:39,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-11-09 09:42:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:39,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705287604] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:39,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:39,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2021-11-09 09:42:39,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526377963] [2021-11-09 09:42:39,473 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:39,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:39,473 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 4 times [2021-11-09 09:42:39,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:39,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143726587] [2021-11-09 09:42:39,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:39,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:39,484 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:39,488 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:39,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:39,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-09 09:42:39,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-09 09:42:39,544 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 7 Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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-09 09:42:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:39,724 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2021-11-09 09:42:39,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:42:39,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2021-11-09 09:42:39,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:39,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 27 transitions. [2021-11-09 09:42:39,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:39,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:39,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2021-11-09 09:42:39,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:39,726 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-11-09 09:42:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2021-11-09 09:42:39,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-11-09 09:42:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 states have internal predecessors, (26), 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-09 09:42:39,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-11-09 09:42:39,731 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-11-09 09:42:39,731 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-11-09 09:42:39,731 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-09 09:42:39,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2021-11-09 09:42:39,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:39,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:39,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:39,733 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:39,733 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:39,733 INFO L791 eck$LassoCheckResult]: Stem: 1200#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1201#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 1212#L536 assume !(main_~length~0 < 1); 1202#L536-2 assume !(main_~n~1 < 1); 1203#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 1196#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 1197#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1198#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 1199#L545-4 main_~i~1 := 0; 1206#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1207#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1208#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1209#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1217#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1216#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1215#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 1204#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 1205#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 1214#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 1213#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 1210#L528-2 [2021-11-09 09:42:39,733 INFO L793 eck$LassoCheckResult]: Loop: 1210#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 1211#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 1210#L528-2 [2021-11-09 09:42:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash -795151063, now seen corresponding path program 3 times [2021-11-09 09:42:39,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:39,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780535297] [2021-11-09 09:42:39,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:39,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:39,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:39,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780535297] [2021-11-09 09:42:39,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780535297] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:39,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231573146] [2021-11-09 09:42:39,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-09 09:42:39,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:39,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:39,892 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:39,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2021-11-09 09:42:40,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-09 09:42:40,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:42:40,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-09 09:42:40,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:40,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231573146] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:40,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:40,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-11-09 09:42:40,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72530586] [2021-11-09 09:42:40,184 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:40,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 5 times [2021-11-09 09:42:40,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:40,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257936014] [2021-11-09 09:42:40,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:40,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:40,190 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:40,195 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:40,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:40,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-09 09:42:40,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-09 09:42:40,233 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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-09 09:42:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:40,377 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2021-11-09 09:42:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 09:42:40,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2021-11-09 09:42:40,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:40,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 29 transitions. [2021-11-09 09:42:40,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:40,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:40,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2021-11-09 09:42:40,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:40,379 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-11-09 09:42:40,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2021-11-09 09:42:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-11-09 09:42:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 states have internal predecessors, (28), 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-09 09:42:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-11-09 09:42:40,381 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-11-09 09:42:40,381 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-11-09 09:42:40,381 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-09 09:42:40,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2021-11-09 09:42:40,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:40,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:40,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:40,382 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:40,382 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:40,382 INFO L791 eck$LassoCheckResult]: Stem: 1334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1335#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 1346#L536 assume !(main_~length~0 < 1); 1336#L536-2 assume !(main_~n~1 < 1); 1337#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 1330#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 1331#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1332#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 1333#L545-4 main_~i~1 := 0; 1340#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1341#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1342#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1343#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1349#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1353#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1352#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1351#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1350#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 1338#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 1339#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 1348#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 1347#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 1344#L528-2 [2021-11-09 09:42:40,382 INFO L793 eck$LassoCheckResult]: Loop: 1344#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 1345#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 1344#L528-2 [2021-11-09 09:42:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:40,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1995057991, now seen corresponding path program 4 times [2021-11-09 09:42:40,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:40,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792244385] [2021-11-09 09:42:40,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:40,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:40,498 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-09 09:42:40,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:40,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792244385] [2021-11-09 09:42:40,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792244385] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:40,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71872809] [2021-11-09 09:42:40,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-09 09:42:40,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:40,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:40,500 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:40,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2021-11-09 09:42:40,628 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-09 09:42:40,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:42:40,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-09 09:42:40,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:40,917 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-09 09:42:40,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71872809] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:40,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:40,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-11-09 09:42:40,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402855028] [2021-11-09 09:42:40,919 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:40,920 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 6 times [2021-11-09 09:42:40,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:40,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067210154] [2021-11-09 09:42:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:40,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:40,928 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:40,935 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:40,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:40,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-09 09:42:40,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-11-09 09:42:40,991 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 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-09 09:42:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:41,233 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2021-11-09 09:42:41,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-09 09:42:41,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 33 transitions. [2021-11-09 09:42:41,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:41,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 31 transitions. [2021-11-09 09:42:41,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:41,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:41,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2021-11-09 09:42:41,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:41,236 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-11-09 09:42:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2021-11-09 09:42:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2021-11-09 09:42:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:42:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-11-09 09:42:41,238 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-11-09 09:42:41,238 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-11-09 09:42:41,238 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-09 09:42:41,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2021-11-09 09:42:41,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:41,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:41,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:41,243 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:41,244 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:41,244 INFO L791 eck$LassoCheckResult]: Stem: 1485#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1486#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 1497#L536 assume !(main_~length~0 < 1); 1487#L536-2 assume !(main_~n~1 < 1); 1488#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 1481#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 1482#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1483#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 1484#L545-4 main_~i~1 := 0; 1491#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1492#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1493#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1494#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1500#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1506#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1505#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1504#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1503#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1502#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1501#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 1489#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 1490#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 1499#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 1498#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 1495#L528-2 [2021-11-09 09:42:41,245 INFO L793 eck$LassoCheckResult]: Loop: 1495#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 1496#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 1495#L528-2 [2021-11-09 09:42:41,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash -968601115, now seen corresponding path program 5 times [2021-11-09 09:42:41,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:41,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053520038] [2021-11-09 09:42:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:41,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:41,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:41,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053520038] [2021-11-09 09:42:41,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053520038] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:41,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317779588] [2021-11-09 09:42:41,459 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-09 09:42:41,459 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:41,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:41,464 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:41,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2021-11-09 09:42:41,616 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-11-09 09:42:41,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:42:41,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-09 09:42:41,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:41,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317779588] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:41,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:41,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-11-09 09:42:41,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503904491] [2021-11-09 09:42:41,940 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:41,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:41,940 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 7 times [2021-11-09 09:42:41,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:41,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188552593] [2021-11-09 09:42:41,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:41,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:41,946 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:41,950 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:42,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:42,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-09 09:42:42,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-11-09 09:42:42,001 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. cyclomatic complexity: 7 Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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-09 09:42:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:42,299 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-11-09 09:42:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 09:42:42,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2021-11-09 09:42:42,300 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:42,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 33 transitions. [2021-11-09 09:42:42,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:42,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:42,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2021-11-09 09:42:42,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:42,301 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-11-09 09:42:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2021-11-09 09:42:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-11-09 09:42:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 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-09 09:42:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-11-09 09:42:42,304 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-11-09 09:42:42,304 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-11-09 09:42:42,304 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-09 09:42:42,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2021-11-09 09:42:42,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:42,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:42,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:42,306 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:42,307 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:42,307 INFO L791 eck$LassoCheckResult]: Stem: 1650#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1651#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 1662#L536 assume !(main_~length~0 < 1); 1652#L536-2 assume !(main_~n~1 < 1); 1653#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 1646#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 1647#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1648#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 1649#L545-4 main_~i~1 := 0; 1656#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1657#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1658#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1659#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1665#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1673#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1672#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1671#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1670#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1669#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1668#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1667#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1666#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 1654#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 1655#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 1664#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 1663#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 1660#L528-2 [2021-11-09 09:42:42,307 INFO L793 eck$LassoCheckResult]: Loop: 1660#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 1661#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 1660#L528-2 [2021-11-09 09:42:42,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1481684733, now seen corresponding path program 6 times [2021-11-09 09:42:42,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:42,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486782814] [2021-11-09 09:42:42,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:42,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:42,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:42,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486782814] [2021-11-09 09:42:42,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486782814] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:42,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669257528] [2021-11-09 09:42:42,499 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-09 09:42:42,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:42,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:42,501 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:42,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2021-11-09 09:42:42,765 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-11-09 09:42:42,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:42:42,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-09 09:42:42,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:43,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669257528] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:43,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:43,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2021-11-09 09:42:43,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662280993] [2021-11-09 09:42:43,151 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:43,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 8 times [2021-11-09 09:42:43,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:43,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748378] [2021-11-09 09:42:43,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:43,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:43,161 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:43,168 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:43,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:43,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-09 09:42:43,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-11-09 09:42:43,219 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:42:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:43,534 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-11-09 09:42:43,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-09 09:42:43,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2021-11-09 09:42:43,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:43,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 35 transitions. [2021-11-09 09:42:43,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:43,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:43,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2021-11-09 09:42:43,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:43,537 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-11-09 09:42:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2021-11-09 09:42:43,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-11-09 09:42:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 29 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-09 09:42:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-11-09 09:42:43,539 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-11-09 09:42:43,539 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-11-09 09:42:43,540 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-11-09 09:42:43,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2021-11-09 09:42:43,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:43,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:43,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:43,541 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:43,541 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:43,541 INFO L791 eck$LassoCheckResult]: Stem: 1829#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1830#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 1841#L536 assume !(main_~length~0 < 1); 1831#L536-2 assume !(main_~n~1 < 1); 1832#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 1825#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 1826#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1827#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 1828#L545-4 main_~i~1 := 0; 1835#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1836#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1837#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1838#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1844#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1854#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1853#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1852#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1851#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1850#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1849#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1848#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1847#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1846#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1845#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 1833#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 1834#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 1843#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 1842#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 1839#L528-2 [2021-11-09 09:42:43,541 INFO L793 eck$LassoCheckResult]: Loop: 1839#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 1840#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 1839#L528-2 [2021-11-09 09:42:43,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -633802591, now seen corresponding path program 7 times [2021-11-09 09:42:43,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:43,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427573887] [2021-11-09 09:42:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:43,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:43,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:43,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427573887] [2021-11-09 09:42:43,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427573887] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:43,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890964901] [2021-11-09 09:42:43,736 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-09 09:42:43,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:43,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:43,737 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:43,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2021-11-09 09:42:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:43,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-09 09:42:43,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:44,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890964901] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:44,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:44,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2021-11-09 09:42:44,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662263182] [2021-11-09 09:42:44,272 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:44,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:44,272 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 9 times [2021-11-09 09:42:44,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:44,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866307726] [2021-11-09 09:42:44,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:44,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:44,276 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:44,279 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:44,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:44,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-09 09:42:44,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-11-09 09:42:44,327 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. cyclomatic complexity: 7 Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 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-09 09:42:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:44,738 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-11-09 09:42:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-09 09:42:44,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 39 transitions. [2021-11-09 09:42:44,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:44,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 37 transitions. [2021-11-09 09:42:44,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:44,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:44,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2021-11-09 09:42:44,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:44,741 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-11-09 09:42:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2021-11-09 09:42:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-11-09 09:42:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.125) internal successors, (36), 31 states have internal predecessors, (36), 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-09 09:42:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-11-09 09:42:44,743 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-11-09 09:42:44,743 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-11-09 09:42:44,743 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-11-09 09:42:44,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2021-11-09 09:42:44,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:44,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:44,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:44,744 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:44,745 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:44,745 INFO L791 eck$LassoCheckResult]: Stem: 2022#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2023#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 2034#L536 assume !(main_~length~0 < 1); 2024#L536-2 assume !(main_~n~1 < 1); 2025#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 2018#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 2019#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 2020#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 2021#L545-4 main_~i~1 := 0; 2028#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2029#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2030#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2031#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2037#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2049#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2048#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2047#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2046#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2045#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2044#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2043#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2042#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2041#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2040#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2039#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2038#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 2026#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 2027#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 2036#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 2035#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 2032#L528-2 [2021-11-09 09:42:44,746 INFO L793 eck$LassoCheckResult]: Loop: 2032#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 2033#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 2032#L528-2 [2021-11-09 09:42:44,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1862850369, now seen corresponding path program 8 times [2021-11-09 09:42:44,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:44,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168703833] [2021-11-09 09:42:44,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:44,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:44,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:44,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168703833] [2021-11-09 09:42:44,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168703833] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:44,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117307681] [2021-11-09 09:42:44,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-09 09:42:44,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:44,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:44,955 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:44,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2021-11-09 09:42:45,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-09 09:42:45,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:42:45,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-09 09:42:45,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:45,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117307681] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:45,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:45,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-11-09 09:42:45,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842499385] [2021-11-09 09:42:45,583 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:45,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 10 times [2021-11-09 09:42:45,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:45,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356298824] [2021-11-09 09:42:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:45,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:45,605 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:45,610 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:45,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:45,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-09 09:42:45,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2021-11-09 09:42:45,656 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. cyclomatic complexity: 7 Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 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-09 09:42:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:46,124 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2021-11-09 09:42:46,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-09 09:42:46,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2021-11-09 09:42:46,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:46,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 39 transitions. [2021-11-09 09:42:46,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:46,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:46,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2021-11-09 09:42:46,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:46,127 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-11-09 09:42:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2021-11-09 09:42:46,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-11-09 09:42:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 33 states have internal predecessors, (38), 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-09 09:42:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-11-09 09:42:46,129 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-11-09 09:42:46,129 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-11-09 09:42:46,130 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-11-09 09:42:46,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2021-11-09 09:42:46,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:46,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:46,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:46,131 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:46,131 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:46,132 INFO L791 eck$LassoCheckResult]: Stem: 2229#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2230#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 2241#L536 assume !(main_~length~0 < 1); 2231#L536-2 assume !(main_~n~1 < 1); 2232#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 2225#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 2226#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 2227#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 2228#L545-4 main_~i~1 := 0; 2235#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2236#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2237#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2238#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2244#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2258#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2257#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2256#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2255#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2254#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2253#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2252#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2251#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2250#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2249#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2248#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2247#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2246#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2245#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 2233#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 2234#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 2243#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 2242#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 2239#L528-2 [2021-11-09 09:42:46,132 INFO L793 eck$LassoCheckResult]: Loop: 2239#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 2240#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 2239#L528-2 [2021-11-09 09:42:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:46,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1861758627, now seen corresponding path program 9 times [2021-11-09 09:42:46,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:46,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929457989] [2021-11-09 09:42:46,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:46,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:46,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:46,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929457989] [2021-11-09 09:42:46,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929457989] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:46,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073165400] [2021-11-09 09:42:46,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-09 09:42:46,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:46,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:46,368 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:46,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2021-11-09 09:42:46,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-11-09 09:42:46,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:42:46,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-09 09:42:46,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:47,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073165400] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:47,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:47,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-11-09 09:42:47,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923799233] [2021-11-09 09:42:47,029 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:47,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:47,029 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 11 times [2021-11-09 09:42:47,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:47,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613088846] [2021-11-09 09:42:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:47,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:47,035 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:47,038 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:47,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:47,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-09 09:42:47,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-11-09 09:42:47,082 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. cyclomatic complexity: 7 Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 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-09 09:42:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:47,313 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2021-11-09 09:42:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-09 09:42:47,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2021-11-09 09:42:47,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:47,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 37 states and 41 transitions. [2021-11-09 09:42:47,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:47,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:47,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2021-11-09 09:42:47,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:47,317 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2021-11-09 09:42:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2021-11-09 09:42:47,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2021-11-09 09:42:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 35 states have internal predecessors, (40), 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-09 09:42:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-11-09 09:42:47,320 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-11-09 09:42:47,320 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-11-09 09:42:47,320 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-11-09 09:42:47,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2021-11-09 09:42:47,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:47,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:47,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:47,322 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:47,322 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:47,326 INFO L791 eck$LassoCheckResult]: Stem: 2419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2420#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 2431#L536 assume !(main_~length~0 < 1); 2421#L536-2 assume !(main_~n~1 < 1); 2422#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 2415#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 2416#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 2417#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 2418#L545-4 main_~i~1 := 0; 2425#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2426#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2427#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2428#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2434#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2450#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2449#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2448#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2447#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2446#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2445#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2444#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2443#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2442#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2441#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2440#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2439#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2438#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2437#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2436#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2435#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 2423#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 2424#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 2433#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 2432#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 2429#L528-2 [2021-11-09 09:42:47,326 INFO L793 eck$LassoCheckResult]: Loop: 2429#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 2430#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 2429#L528-2 [2021-11-09 09:42:47,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:47,327 INFO L85 PathProgramCache]: Analyzing trace with hash -812594565, now seen corresponding path program 10 times [2021-11-09 09:42:47,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:47,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570044468] [2021-11-09 09:42:47,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:47,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:47,560 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-09 09:42:47,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:47,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570044468] [2021-11-09 09:42:47,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570044468] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:47,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894152502] [2021-11-09 09:42:47,560 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-09 09:42:47,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:47,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:47,562 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:47,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2021-11-09 09:42:47,822 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-09 09:42:47,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:42:47,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-09 09:42:47,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:48,389 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-09 09:42:48,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894152502] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:48,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:48,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2021-11-09 09:42:48,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977546746] [2021-11-09 09:42:48,390 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:48,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:48,390 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 12 times [2021-11-09 09:42:48,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:48,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804050146] [2021-11-09 09:42:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:48,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:48,394 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:48,397 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:48,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:48,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-09 09:42:48,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2021-11-09 09:42:48,445 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. cyclomatic complexity: 7 Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 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-09 09:42:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:49,019 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-11-09 09:42:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-09 09:42:49,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2021-11-09 09:42:49,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:49,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 43 transitions. [2021-11-09 09:42:49,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:49,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:49,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2021-11-09 09:42:49,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:49,021 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2021-11-09 09:42:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2021-11-09 09:42:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-11-09 09:42:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 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-09 09:42:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-11-09 09:42:49,024 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-11-09 09:42:49,024 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-11-09 09:42:49,024 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-11-09 09:42:49,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2021-11-09 09:42:49,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:49,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:49,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:49,025 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:49,026 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:49,026 INFO L791 eck$LassoCheckResult]: Stem: 2654#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2655#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 2666#L536 assume !(main_~length~0 < 1); 2656#L536-2 assume !(main_~n~1 < 1); 2657#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 2650#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 2651#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 2652#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 2653#L545-4 main_~i~1 := 0; 2660#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2661#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2662#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2663#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2669#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2687#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2686#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2685#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2684#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2683#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2682#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2681#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2680#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2679#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2678#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2677#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2676#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2675#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2674#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2673#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2672#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2671#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2670#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 2658#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 2659#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 2668#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 2667#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 2664#L528-2 [2021-11-09 09:42:49,026 INFO L793 eck$LassoCheckResult]: Loop: 2664#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 2665#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 2664#L528-2 [2021-11-09 09:42:49,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:49,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1883245543, now seen corresponding path program 11 times [2021-11-09 09:42:49,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:49,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507853845] [2021-11-09 09:42:49,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:49,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:49,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:49,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507853845] [2021-11-09 09:42:49,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507853845] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:49,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529401429] [2021-11-09 09:42:49,321 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-09 09:42:49,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:49,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:49,324 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:49,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2021-11-09 09:42:49,593 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2021-11-09 09:42:49,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:42:49,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-09 09:42:49,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:50,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529401429] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:50,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:50,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-09 09:42:50,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666328564] [2021-11-09 09:42:50,275 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:50,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:50,276 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 13 times [2021-11-09 09:42:50,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:50,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010813336] [2021-11-09 09:42:50,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:50,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:50,281 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:50,284 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:50,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:50,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-09 09:42:50,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2021-11-09 09:42:50,338 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. cyclomatic complexity: 7 Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 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-09 09:42:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:50,983 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2021-11-09 09:42:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-09 09:42:50,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2021-11-09 09:42:50,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:50,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 45 transitions. [2021-11-09 09:42:50,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:50,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:50,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions. [2021-11-09 09:42:50,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:50,985 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-11-09 09:42:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions. [2021-11-09 09:42:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2021-11-09 09:42:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.1) internal successors, (44), 39 states have internal predecessors, (44), 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-09 09:42:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-11-09 09:42:50,987 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-11-09 09:42:50,987 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-11-09 09:42:50,987 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-11-09 09:42:50,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2021-11-09 09:42:50,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:50,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:50,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:50,988 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:50,988 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:50,989 INFO L791 eck$LassoCheckResult]: Stem: 2903#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2904#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 2915#L536 assume !(main_~length~0 < 1); 2905#L536-2 assume !(main_~n~1 < 1); 2906#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 2899#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 2900#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 2901#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 2902#L545-4 main_~i~1 := 0; 2909#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2910#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2911#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2912#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2918#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2938#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2937#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2936#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2935#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2934#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2933#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2932#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2931#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2930#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2929#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2928#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2927#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2926#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2925#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2924#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2923#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2922#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2921#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 2920#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 2919#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 2907#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 2908#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 2917#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 2916#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 2913#L528-2 [2021-11-09 09:42:50,989 INFO L793 eck$LassoCheckResult]: Loop: 2913#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 2914#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 2913#L528-2 [2021-11-09 09:42:50,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash 13315639, now seen corresponding path program 12 times [2021-11-09 09:42:50,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:50,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701225287] [2021-11-09 09:42:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:50,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:51,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:51,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701225287] [2021-11-09 09:42:51,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701225287] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:51,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331594521] [2021-11-09 09:42:51,306 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-09 09:42:51,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:51,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:51,311 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:51,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2021-11-09 09:42:52,036 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2021-11-09 09:42:52,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:42:52,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-09 09:42:52,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:42:52,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331594521] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:52,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:52,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 23 [2021-11-09 09:42:52,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598998277] [2021-11-09 09:42:52,481 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 14 times [2021-11-09 09:42:52,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:52,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495519634] [2021-11-09 09:42:52,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:52,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:52,490 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:52,493 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:52,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:52,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-09 09:42:52,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2021-11-09 09:42:52,535 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. cyclomatic complexity: 7 Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 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-09 09:42:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:53,360 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2021-11-09 09:42:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-09 09:42:53,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2021-11-09 09:42:53,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-09 09:42:53,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 81 states and 88 transitions. [2021-11-09 09:42:53,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-11-09 09:42:53,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-11-09 09:42:53,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 88 transitions. [2021-11-09 09:42:53,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:53,364 INFO L681 BuchiCegarLoop]: Abstraction has 81 states and 88 transitions. [2021-11-09 09:42:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 88 transitions. [2021-11-09 09:42:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 42. [2021-11-09 09:42:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 41 states have internal predecessors, (46), 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-09 09:42:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-11-09 09:42:53,367 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-11-09 09:42:53,367 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-11-09 09:42:53,367 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-11-09 09:42:53,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 46 transitions. [2021-11-09 09:42:53,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:53,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:53,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:53,368 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:53,368 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:53,369 INFO L791 eck$LassoCheckResult]: Stem: 3201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3202#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 3213#L536 assume !(main_~length~0 < 1); 3203#L536-2 assume !(main_~n~1 < 1); 3204#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 3197#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 3198#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 3199#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 3200#L545-4 main_~i~1 := 0; 3207#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3208#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3209#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3210#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3216#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3238#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3237#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3236#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3235#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3234#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3233#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3232#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3231#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3230#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3229#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3228#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3227#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3226#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3225#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3224#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3223#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3222#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3221#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3220#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3219#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3218#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3217#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 3205#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 3206#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 3215#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 3214#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 3211#L528-2 [2021-11-09 09:42:53,369 INFO L793 eck$LassoCheckResult]: Loop: 3211#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 3212#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 3211#L528-2 [2021-11-09 09:42:53,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:53,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1542478037, now seen corresponding path program 13 times [2021-11-09 09:42:53,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:53,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790562469] [2021-11-09 09:42:53,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:53,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:53,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:53,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790562469] [2021-11-09 09:42:53,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790562469] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:53,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404191478] [2021-11-09 09:42:53,687 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-09 09:42:53,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:53,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:53,688 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:53,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2021-11-09 09:42:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:53,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-09 09:42:53,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:54,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404191478] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:54,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:54,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 36 [2021-11-09 09:42:54,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952993929] [2021-11-09 09:42:54,734 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:54,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:54,734 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 15 times [2021-11-09 09:42:54,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:54,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225728266] [2021-11-09 09:42:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:54,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:54,740 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:54,743 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:54,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:54,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-09 09:42:54,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2021-11-09 09:42:54,790 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. cyclomatic complexity: 7 Second operand has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 36 states have internal predecessors, (77), 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-09 09:42:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:55,515 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2021-11-09 09:42:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-09 09:42:55,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 51 transitions. [2021-11-09 09:42:55,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:55,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 49 transitions. [2021-11-09 09:42:55,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:55,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:55,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2021-11-09 09:42:55,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:55,517 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-11-09 09:42:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2021-11-09 09:42:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2021-11-09 09:42:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 43 states have internal predecessors, (48), 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-09 09:42:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-11-09 09:42:55,520 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-11-09 09:42:55,520 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-11-09 09:42:55,520 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-11-09 09:42:55,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2021-11-09 09:42:55,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:55,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:55,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:55,521 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:55,521 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:55,522 INFO L791 eck$LassoCheckResult]: Stem: 3478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3479#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 3490#L536 assume !(main_~length~0 < 1); 3480#L536-2 assume !(main_~n~1 < 1); 3481#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 3474#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 3475#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 3476#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 3477#L545-4 main_~i~1 := 0; 3484#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3485#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3486#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3487#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3493#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3517#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3516#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3515#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3514#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3513#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3512#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3511#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3510#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3509#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3508#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3507#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3506#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3505#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3504#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3503#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3502#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3501#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3500#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3499#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3498#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3497#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3496#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3495#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3494#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 3482#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 3483#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 3492#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 3491#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 3488#L528-2 [2021-11-09 09:42:55,522 INFO L793 eck$LassoCheckResult]: Loop: 3488#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 3489#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 3488#L528-2 [2021-11-09 09:42:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:55,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2106240013, now seen corresponding path program 14 times [2021-11-09 09:42:55,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:55,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399170417] [2021-11-09 09:42:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:55,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:55,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:55,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399170417] [2021-11-09 09:42:55,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399170417] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:55,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641711542] [2021-11-09 09:42:55,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-09 09:42:55,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:55,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:55,892 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:55,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2021-11-09 09:42:56,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-09 09:42:56,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:42:56,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-09 09:42:56,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:42:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:57,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641711542] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:57,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:42:57,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2021-11-09 09:42:57,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999940594] [2021-11-09 09:42:57,055 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:42:57,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 16 times [2021-11-09 09:42:57,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:57,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865976223] [2021-11-09 09:42:57,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:57,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:57,062 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:42:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:42:57,065 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:42:57,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:42:57,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-09 09:42:57,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1204, Unknown=0, NotChecked=0, Total=1406 [2021-11-09 09:42:57,119 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. cyclomatic complexity: 7 Second operand has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 38 states have internal predecessors, (79), 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-09 09:42:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:42:57,862 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-11-09 09:42:57,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-09 09:42:57,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2021-11-09 09:42:57,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:57,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 51 transitions. [2021-11-09 09:42:57,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:42:57,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:42:57,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 51 transitions. [2021-11-09 09:42:57,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:42:57,865 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2021-11-09 09:42:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 51 transitions. [2021-11-09 09:42:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-11-09 09:42:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 45 states have internal predecessors, (50), 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-09 09:42:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-11-09 09:42:57,868 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-11-09 09:42:57,868 INFO L587 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-11-09 09:42:57,868 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-11-09 09:42:57,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 50 transitions. [2021-11-09 09:42:57,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:42:57,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:42:57,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:42:57,870 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:42:57,870 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:42:57,870 INFO L791 eck$LassoCheckResult]: Stem: 3769#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3770#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 3781#L536 assume !(main_~length~0 < 1); 3771#L536-2 assume !(main_~n~1 < 1); 3772#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 3765#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 3766#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 3767#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 3768#L545-4 main_~i~1 := 0; 3775#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3776#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3777#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3778#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3784#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3810#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3809#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3808#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3807#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3806#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3805#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3804#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3803#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3802#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3801#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3800#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3799#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3798#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3797#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3796#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3795#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3794#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3793#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3792#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3791#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3790#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3789#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3788#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3787#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 3786#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 3785#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 3773#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 3774#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 3783#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 3782#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 3779#L528-2 [2021-11-09 09:42:57,870 INFO L793 eck$LassoCheckResult]: Loop: 3779#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 3780#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 3779#L528-2 [2021-11-09 09:42:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:42:57,871 INFO L85 PathProgramCache]: Analyzing trace with hash 463994769, now seen corresponding path program 15 times [2021-11-09 09:42:57,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:42:57,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74733646] [2021-11-09 09:42:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:42:57,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:42:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:42:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:42:58,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:42:58,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74733646] [2021-11-09 09:42:58,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74733646] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:42:58,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589992017] [2021-11-09 09:42:58,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-09 09:42:58,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:42:58,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:42:58,296 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:42:58,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2021-11-09 09:42:59,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2021-11-09 09:42:59,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:42:59,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-09 09:42:59,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:00,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589992017] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:00,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:00,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2021-11-09 09:43:00,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884178204] [2021-11-09 09:43:00,121 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 17 times [2021-11-09 09:43:00,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:00,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123874295] [2021-11-09 09:43:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:00,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:00,128 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:00,132 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:00,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-09 09:43:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1281, Unknown=0, NotChecked=0, Total=1482 [2021-11-09 09:43:00,181 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. cyclomatic complexity: 7 Second operand has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 39 states have internal predecessors, (77), 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-09 09:43:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:00,912 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2021-11-09 09:43:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-09 09:43:00,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2021-11-09 09:43:00,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:00,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 49 states and 53 transitions. [2021-11-09 09:43:00,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:00,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:00,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2021-11-09 09:43:00,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:00,915 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2021-11-09 09:43:00,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2021-11-09 09:43:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2021-11-09 09:43:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 47 states have internal predecessors, (52), 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-09 09:43:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-11-09 09:43:00,916 INFO L704 BuchiCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-11-09 09:43:00,916 INFO L587 BuchiCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-11-09 09:43:00,916 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-11-09 09:43:00,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 52 transitions. [2021-11-09 09:43:00,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:00,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:00,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:00,918 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:00,918 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:00,918 INFO L791 eck$LassoCheckResult]: Stem: 4071#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4072#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 4083#L536 assume !(main_~length~0 < 1); 4073#L536-2 assume !(main_~n~1 < 1); 4074#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 4067#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 4068#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 4069#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 4070#L545-4 main_~i~1 := 0; 4077#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4078#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4079#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4080#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4086#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4114#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4113#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4112#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4111#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4110#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4109#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4108#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4107#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4106#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4105#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4104#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4103#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4102#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4101#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4100#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4099#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4098#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4097#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4096#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4095#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4094#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4093#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4092#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4091#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4090#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4089#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4088#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4087#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 4075#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 4076#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 4085#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 4084#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 4081#L528-2 [2021-11-09 09:43:00,919 INFO L793 eck$LassoCheckResult]: Loop: 4081#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 4082#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 4081#L528-2 [2021-11-09 09:43:00,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:00,919 INFO L85 PathProgramCache]: Analyzing trace with hash 853425071, now seen corresponding path program 16 times [2021-11-09 09:43:00,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:00,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730435206] [2021-11-09 09:43:00,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:00,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:01,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:01,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730435206] [2021-11-09 09:43:01,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730435206] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:01,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726909669] [2021-11-09 09:43:01,367 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-09 09:43:01,367 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:01,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:01,371 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:01,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2021-11-09 09:43:01,961 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-09 09:43:01,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:43:01,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-09 09:43:01,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:02,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726909669] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:02,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:02,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2021-11-09 09:43:02,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582003962] [2021-11-09 09:43:02,867 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 18 times [2021-11-09 09:43:02,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:02,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116100570] [2021-11-09 09:43:02,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:02,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:02,873 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:02,875 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:02,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:02,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-09 09:43:02,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2021-11-09 09:43:02,926 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. cyclomatic complexity: 7 Second operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 42 states have internal predecessors, (87), 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-09 09:43:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:03,880 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-11-09 09:43:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-09 09:43:03,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 57 transitions. [2021-11-09 09:43:03,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:03,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 55 transitions. [2021-11-09 09:43:03,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:03,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:03,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2021-11-09 09:43:03,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:03,883 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-11-09 09:43:03,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2021-11-09 09:43:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2021-11-09 09:43:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.08) internal successors, (54), 49 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-09 09:43:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-11-09 09:43:03,885 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-11-09 09:43:03,885 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-11-09 09:43:03,885 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-11-09 09:43:03,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 54 transitions. [2021-11-09 09:43:03,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:03,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:03,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:03,886 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:03,886 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:03,887 INFO L791 eck$LassoCheckResult]: Stem: 4390#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4391#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 4402#L536 assume !(main_~length~0 < 1); 4392#L536-2 assume !(main_~n~1 < 1); 4393#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 4386#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 4387#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 4388#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 4389#L545-4 main_~i~1 := 0; 4396#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4397#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4398#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4399#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4405#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4435#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4434#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4433#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4432#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4431#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4430#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4429#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4428#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4427#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4426#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4425#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4424#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4423#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4422#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4421#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4420#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4419#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4418#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4417#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4416#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4415#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4414#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4413#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4412#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4411#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4410#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4409#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4408#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4407#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4406#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 4394#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 4395#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 4404#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 4403#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 4400#L528-2 [2021-11-09 09:43:03,887 INFO L793 eck$LassoCheckResult]: Loop: 4400#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 4401#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 4400#L528-2 [2021-11-09 09:43:03,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:03,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1433790541, now seen corresponding path program 17 times [2021-11-09 09:43:03,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:03,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669751164] [2021-11-09 09:43:03,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:03,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:04,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:04,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669751164] [2021-11-09 09:43:04,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669751164] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:04,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288887329] [2021-11-09 09:43:04,485 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-09 09:43:04,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:04,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:04,500 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:04,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2021-11-09 09:43:05,039 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2021-11-09 09:43:05,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:43:05,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-09 09:43:05,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:05,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288887329] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:05,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:05,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2021-11-09 09:43:05,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036153838] [2021-11-09 09:43:05,444 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:05,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 19 times [2021-11-09 09:43:05,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:05,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830882550] [2021-11-09 09:43:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:05,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:05,461 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:05,464 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:05,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:05,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-09 09:43:05,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2021-11-09 09:43:05,508 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. cyclomatic complexity: 7 Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 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-09 09:43:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:06,107 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2021-11-09 09:43:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-09 09:43:06,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 59 transitions. [2021-11-09 09:43:06,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:06,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 53 states and 57 transitions. [2021-11-09 09:43:06,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:06,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:06,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 57 transitions. [2021-11-09 09:43:06,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:06,110 INFO L681 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-11-09 09:43:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 57 transitions. [2021-11-09 09:43:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2021-11-09 09:43:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 51 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-09 09:43:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-11-09 09:43:06,112 INFO L704 BuchiCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-11-09 09:43:06,112 INFO L587 BuchiCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-11-09 09:43:06,112 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-11-09 09:43:06,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 56 transitions. [2021-11-09 09:43:06,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:06,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:06,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:06,117 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:06,117 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:06,118 INFO L791 eck$LassoCheckResult]: Stem: 4668#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4669#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 4680#L536 assume !(main_~length~0 < 1); 4670#L536-2 assume !(main_~n~1 < 1); 4671#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 4664#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 4665#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 4666#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 4667#L545-4 main_~i~1 := 0; 4674#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4675#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4676#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4677#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4683#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4715#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4714#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4713#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4712#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4711#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4710#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4709#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4708#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4707#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4706#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4705#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4704#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4703#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4702#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4701#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4700#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4699#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4698#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4697#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4696#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4695#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4694#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4693#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4692#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4691#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4690#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4689#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4688#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4687#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4686#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4685#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4684#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 4672#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 4673#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 4682#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 4681#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 4678#L528-2 [2021-11-09 09:43:06,118 INFO L793 eck$LassoCheckResult]: Loop: 4678#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 4679#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 4678#L528-2 [2021-11-09 09:43:06,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash 819258731, now seen corresponding path program 18 times [2021-11-09 09:43:06,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:06,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938592049] [2021-11-09 09:43:06,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:06,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:06,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:06,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938592049] [2021-11-09 09:43:06,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938592049] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:06,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76720754] [2021-11-09 09:43:06,652 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-09 09:43:06,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:06,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:06,654 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:06,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2021-11-09 09:43:09,659 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2021-11-09 09:43:09,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:43:09,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-09 09:43:09,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:10,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76720754] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:10,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:10,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 26 [2021-11-09 09:43:10,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622164732] [2021-11-09 09:43:10,051 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 20 times [2021-11-09 09:43:10,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:10,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088772157] [2021-11-09 09:43:10,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:10,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:10,082 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:10,085 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:10,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:10,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-09 09:43:10,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2021-11-09 09:43:10,132 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. cyclomatic complexity: 7 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-09 09:43:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:10,720 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2021-11-09 09:43:10,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-09 09:43:10,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 61 transitions. [2021-11-09 09:43:10,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:10,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 59 transitions. [2021-11-09 09:43:10,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:10,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:10,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2021-11-09 09:43:10,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:10,723 INFO L681 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-11-09 09:43:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2021-11-09 09:43:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2021-11-09 09:43:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 53 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-09 09:43:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-11-09 09:43:10,725 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-11-09 09:43:10,725 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-11-09 09:43:10,725 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-11-09 09:43:10,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 58 transitions. [2021-11-09 09:43:10,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:10,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:10,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:10,727 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:10,727 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:10,727 INFO L791 eck$LassoCheckResult]: Stem: 4957#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4958#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 4969#L536 assume !(main_~length~0 < 1); 4959#L536-2 assume !(main_~n~1 < 1); 4960#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 4953#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 4954#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 4955#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 4956#L545-4 main_~i~1 := 0; 4963#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4964#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4965#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4966#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4972#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5006#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5005#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5004#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5003#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5002#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5001#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5000#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4999#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4998#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4997#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4996#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4995#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4994#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4993#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4992#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4991#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4990#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4989#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4988#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4987#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4986#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4985#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4984#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4983#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4982#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4981#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4980#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4979#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4978#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4977#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4976#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4975#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 4974#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 4973#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 4961#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 4962#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 4971#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 4970#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 4967#L528-2 [2021-11-09 09:43:10,728 INFO L793 eck$LassoCheckResult]: Loop: 4967#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 4968#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 4967#L528-2 [2021-11-09 09:43:10,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:10,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1335291127, now seen corresponding path program 19 times [2021-11-09 09:43:10,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:10,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614831342] [2021-11-09 09:43:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:10,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:11,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:11,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614831342] [2021-11-09 09:43:11,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614831342] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:11,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366800097] [2021-11-09 09:43:11,234 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-09 09:43:11,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:11,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:11,237 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:11,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2021-11-09 09:43:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:11,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-09 09:43:11,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:12,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366800097] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:12,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:12,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2021-11-09 09:43:12,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913016332] [2021-11-09 09:43:12,729 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:12,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:12,729 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 21 times [2021-11-09 09:43:12,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:12,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258285289] [2021-11-09 09:43:12,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:12,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:12,735 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:12,737 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:12,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:12,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-09 09:43:12,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1944, Unknown=0, NotChecked=0, Total=2256 [2021-11-09 09:43:12,784 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. cyclomatic complexity: 7 Second operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 48 states have internal predecessors, (101), 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-09 09:43:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:13,844 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2021-11-09 09:43:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-09 09:43:13,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 63 transitions. [2021-11-09 09:43:13,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:13,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 57 states and 61 transitions. [2021-11-09 09:43:13,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:13,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:13,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 61 transitions. [2021-11-09 09:43:13,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:13,853 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-11-09 09:43:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 61 transitions. [2021-11-09 09:43:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2021-11-09 09:43:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 55 states have internal predecessors, (60), 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-09 09:43:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-11-09 09:43:13,857 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-11-09 09:43:13,857 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-11-09 09:43:13,857 INFO L425 BuchiCegarLoop]: ======== Iteration 27============ [2021-11-09 09:43:13,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2021-11-09 09:43:13,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:13,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:13,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:13,859 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:13,859 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:13,859 INFO L791 eck$LassoCheckResult]: Stem: 5318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5319#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 5330#L536 assume !(main_~length~0 < 1); 5320#L536-2 assume !(main_~n~1 < 1); 5321#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 5314#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 5315#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 5316#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 5317#L545-4 main_~i~1 := 0; 5324#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5325#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5326#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5327#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5333#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5369#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5368#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5367#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5366#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5365#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5364#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5363#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5362#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5361#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5360#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5359#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5358#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5357#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5356#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5355#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5354#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5353#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5352#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5351#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5350#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5349#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5348#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5347#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5346#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5345#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5344#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5343#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5342#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5341#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5340#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5339#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5338#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5337#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5336#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5335#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5334#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 5322#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 5323#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 5332#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 5331#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 5328#L528-2 [2021-11-09 09:43:13,860 INFO L793 eck$LassoCheckResult]: Loop: 5328#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 5329#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 5328#L528-2 [2021-11-09 09:43:13,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1683467993, now seen corresponding path program 20 times [2021-11-09 09:43:13,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:13,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439028251] [2021-11-09 09:43:13,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:13,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:14,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:14,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439028251] [2021-11-09 09:43:14,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439028251] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:14,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364454326] [2021-11-09 09:43:14,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-09 09:43:14,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:14,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:14,334 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:14,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2021-11-09 09:43:14,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-09 09:43:14,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:43:14,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-09 09:43:14,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:15,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364454326] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:15,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:15,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-11-09 09:43:15,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779135598] [2021-11-09 09:43:15,793 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 22 times [2021-11-09 09:43:15,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:15,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052043769] [2021-11-09 09:43:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:15,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:15,799 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:15,802 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:15,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-09 09:43:15,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=2113, Unknown=0, NotChecked=0, Total=2450 [2021-11-09 09:43:15,864 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. cyclomatic complexity: 7 Second operand has 50 states, 50 states have (on average 2.06) internal successors, (103), 50 states have internal predecessors, (103), 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-09 09:43:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:16,953 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2021-11-09 09:43:16,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-09 09:43:16,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 65 transitions. [2021-11-09 09:43:16,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:16,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 59 states and 63 transitions. [2021-11-09 09:43:16,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:16,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:16,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 63 transitions. [2021-11-09 09:43:16,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:16,956 INFO L681 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-11-09 09:43:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 63 transitions. [2021-11-09 09:43:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2021-11-09 09:43:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 57 states have internal predecessors, (62), 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-09 09:43:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2021-11-09 09:43:16,958 INFO L704 BuchiCegarLoop]: Abstraction has 58 states and 62 transitions. [2021-11-09 09:43:16,959 INFO L587 BuchiCegarLoop]: Abstraction has 58 states and 62 transitions. [2021-11-09 09:43:16,959 INFO L425 BuchiCegarLoop]: ======== Iteration 28============ [2021-11-09 09:43:16,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 62 transitions. [2021-11-09 09:43:16,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:16,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:16,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:16,961 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:16,961 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:16,961 INFO L791 eck$LassoCheckResult]: Stem: 5693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5694#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 5705#L536 assume !(main_~length~0 < 1); 5695#L536-2 assume !(main_~n~1 < 1); 5696#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 5689#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 5690#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 5691#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 5692#L545-4 main_~i~1 := 0; 5699#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5700#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5701#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5702#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5708#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5746#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5745#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5744#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5743#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5742#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5741#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5740#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5739#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5738#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5737#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5736#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5735#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5734#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5733#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5732#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5731#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5730#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5729#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5728#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5727#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5726#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5725#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5724#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5723#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5722#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5721#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5720#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5719#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5718#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5717#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5716#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5715#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5714#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5713#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5712#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5711#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 5710#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 5709#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 5697#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 5698#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 5707#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 5706#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 5703#L528-2 [2021-11-09 09:43:16,961 INFO L793 eck$LassoCheckResult]: Loop: 5703#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 5704#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 5703#L528-2 [2021-11-09 09:43:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1273987131, now seen corresponding path program 21 times [2021-11-09 09:43:16,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:16,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855090798] [2021-11-09 09:43:16,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:16,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:17,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:17,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855090798] [2021-11-09 09:43:17,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855090798] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:17,535 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632600497] [2021-11-09 09:43:17,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-09 09:43:17,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:17,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:17,547 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:17,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2021-11-09 09:43:19,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2021-11-09 09:43:19,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:43:19,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-09 09:43:19,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:20,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632600497] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:20,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:20,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 53 [2021-11-09 09:43:20,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543283252] [2021-11-09 09:43:20,621 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:20,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:20,622 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 23 times [2021-11-09 09:43:20,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:20,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052136480] [2021-11-09 09:43:20,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:20,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:20,629 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:20,632 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:20,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:20,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-11-09 09:43:20,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=2406, Unknown=0, NotChecked=0, Total=2756 [2021-11-09 09:43:20,684 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. cyclomatic complexity: 7 Second operand has 53 states, 53 states have (on average 2.018867924528302) internal successors, (107), 53 states have internal predecessors, (107), 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-09 09:43:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:22,673 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2021-11-09 09:43:22,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-09 09:43:22,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 67 transitions. [2021-11-09 09:43:22,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:22,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 61 states and 65 transitions. [2021-11-09 09:43:22,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:22,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:22,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 65 transitions. [2021-11-09 09:43:22,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:22,675 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2021-11-09 09:43:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 65 transitions. [2021-11-09 09:43:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2021-11-09 09:43:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 59 states have internal predecessors, (64), 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-09 09:43:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2021-11-09 09:43:22,676 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 64 transitions. [2021-11-09 09:43:22,677 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 64 transitions. [2021-11-09 09:43:22,677 INFO L425 BuchiCegarLoop]: ======== Iteration 29============ [2021-11-09 09:43:22,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 64 transitions. [2021-11-09 09:43:22,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:22,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:22,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:22,677 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:22,678 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:22,678 INFO L791 eck$LassoCheckResult]: Stem: 6121#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6122#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 6133#L536 assume !(main_~length~0 < 1); 6123#L536-2 assume !(main_~n~1 < 1); 6124#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 6117#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 6118#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 6119#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 6120#L545-4 main_~i~1 := 0; 6127#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6128#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6129#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6130#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6136#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6176#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6175#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6174#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6173#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6172#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6171#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6170#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6169#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6168#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6167#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6166#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6165#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6164#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6163#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6162#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6161#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6160#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6159#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6158#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6157#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6156#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6155#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6154#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6153#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6152#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6151#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6150#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6149#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6148#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6147#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6146#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6145#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6144#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6143#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6142#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6141#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6140#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6139#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6138#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6137#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 6125#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 6126#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 6135#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 6134#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 6131#L528-2 [2021-11-09 09:43:22,678 INFO L793 eck$LassoCheckResult]: Loop: 6131#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 6132#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 6131#L528-2 [2021-11-09 09:43:22,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1395097315, now seen corresponding path program 22 times [2021-11-09 09:43:22,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:22,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650197807] [2021-11-09 09:43:22,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:22,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:23,191 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-09 09:43:23,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:23,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650197807] [2021-11-09 09:43:23,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650197807] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:23,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90887593] [2021-11-09 09:43:23,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-09 09:43:23,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:23,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:23,194 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:23,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2021-11-09 09:43:23,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-09 09:43:23,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:43:23,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-09 09:43:23,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:25,215 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-09 09:43:25,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90887593] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:25,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:25,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2021-11-09 09:43:25,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105753869] [2021-11-09 09:43:25,216 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 24 times [2021-11-09 09:43:25,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:25,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788708040] [2021-11-09 09:43:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:25,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:25,225 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:25,227 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:25,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:25,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-11-09 09:43:25,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=2472, Unknown=0, NotChecked=0, Total=2862 [2021-11-09 09:43:25,295 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. cyclomatic complexity: 7 Second operand has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 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-09 09:43:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:26,551 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2021-11-09 09:43:26,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-09 09:43:26,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 69 transitions. [2021-11-09 09:43:26,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:26,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 63 states and 67 transitions. [2021-11-09 09:43:26,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:26,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:26,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 67 transitions. [2021-11-09 09:43:26,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:26,554 INFO L681 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-11-09 09:43:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 67 transitions. [2021-11-09 09:43:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-11-09 09:43:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.064516129032258) internal successors, (66), 61 states have internal predecessors, (66), 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-09 09:43:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2021-11-09 09:43:26,555 INFO L704 BuchiCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-11-09 09:43:26,555 INFO L587 BuchiCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-11-09 09:43:26,555 INFO L425 BuchiCegarLoop]: ======== Iteration 30============ [2021-11-09 09:43:26,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 66 transitions. [2021-11-09 09:43:26,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:26,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:26,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:26,557 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:26,557 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:26,557 INFO L791 eck$LassoCheckResult]: Stem: 6524#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6525#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 6536#L536 assume !(main_~length~0 < 1); 6526#L536-2 assume !(main_~n~1 < 1); 6527#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 6520#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 6521#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 6522#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 6523#L545-4 main_~i~1 := 0; 6530#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6531#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6532#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6533#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6539#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6581#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6580#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6579#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6578#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6577#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6576#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6575#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6574#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6573#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6572#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6571#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6570#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6569#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6568#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6567#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6566#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6565#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6564#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6563#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6562#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6561#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6560#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6559#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6558#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6557#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6556#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6555#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6554#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6553#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6552#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6551#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6550#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6549#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6548#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6547#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6546#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6545#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6544#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6543#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6542#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6541#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6540#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 6528#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 6529#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 6538#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 6537#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 6534#L528-2 [2021-11-09 09:43:26,558 INFO L793 eck$LassoCheckResult]: Loop: 6534#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 6535#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 6534#L528-2 [2021-11-09 09:43:26,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2005193087, now seen corresponding path program 23 times [2021-11-09 09:43:26,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:26,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710582062] [2021-11-09 09:43:26,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:26,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:27,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:27,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710582062] [2021-11-09 09:43:27,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710582062] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:27,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465628715] [2021-11-09 09:43:27,078 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-09 09:43:27,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:27,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:27,080 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:27,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2021-11-09 09:43:28,261 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2021-11-09 09:43:28,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:43:28,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-09 09:43:28,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:29,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465628715] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:29,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:29,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 56 [2021-11-09 09:43:29,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428875891] [2021-11-09 09:43:29,603 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:29,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:29,603 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 25 times [2021-11-09 09:43:29,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:29,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111873739] [2021-11-09 09:43:29,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:29,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:29,609 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:29,612 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:29,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-11-09 09:43:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2662, Unknown=0, NotChecked=0, Total=3080 [2021-11-09 09:43:29,652 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. cyclomatic complexity: 7 Second operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 56 states have internal predecessors, (117), 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-09 09:43:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:30,944 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2021-11-09 09:43:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-09 09:43:30,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 71 transitions. [2021-11-09 09:43:30,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:30,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 65 states and 69 transitions. [2021-11-09 09:43:30,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:30,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:30,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 69 transitions. [2021-11-09 09:43:30,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:30,947 INFO L681 BuchiCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-11-09 09:43:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 69 transitions. [2021-11-09 09:43:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-11-09 09:43:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.0625) internal successors, (68), 63 states have internal predecessors, (68), 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-09 09:43:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2021-11-09 09:43:30,950 INFO L704 BuchiCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-11-09 09:43:30,950 INFO L587 BuchiCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-11-09 09:43:30,950 INFO L425 BuchiCegarLoop]: ======== Iteration 31============ [2021-11-09 09:43:30,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 68 transitions. [2021-11-09 09:43:30,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:30,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:30,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:30,952 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:30,952 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:30,952 INFO L791 eck$LassoCheckResult]: Stem: 6941#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6942#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 6953#L536 assume !(main_~length~0 < 1); 6943#L536-2 assume !(main_~n~1 < 1); 6944#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 6937#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 6938#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 6939#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 6940#L545-4 main_~i~1 := 0; 6947#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6948#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6949#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6950#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6956#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7000#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6999#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6998#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6997#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6996#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6995#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6994#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6993#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6992#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6991#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6990#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6989#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6988#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6987#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6986#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6985#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6984#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6983#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6982#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6981#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6980#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6979#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6978#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6977#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6976#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6975#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6974#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6973#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6972#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6971#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6970#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6969#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6968#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6967#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6966#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6965#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6964#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6963#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6962#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6961#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6960#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6959#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 6958#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 6957#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 6945#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 6946#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 6955#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 6954#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 6951#L528-2 [2021-11-09 09:43:30,953 INFO L793 eck$LassoCheckResult]: Loop: 6951#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 6952#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 6951#L528-2 [2021-11-09 09:43:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:30,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1214157153, now seen corresponding path program 24 times [2021-11-09 09:43:30,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:30,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532215459] [2021-11-09 09:43:30,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:30,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:31,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:31,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532215459] [2021-11-09 09:43:31,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532215459] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:31,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549668544] [2021-11-09 09:43:31,589 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-09 09:43:31,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:31,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:31,591 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:31,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2021-11-09 09:43:37,155 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2021-11-09 09:43:37,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:43:37,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 53 conjunts are in the unsatisfiable core [2021-11-09 09:43:37,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:37,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549668544] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:37,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:37,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 41 [2021-11-09 09:43:37,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91316056] [2021-11-09 09:43:37,778 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:37,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:37,778 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 26 times [2021-11-09 09:43:37,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:37,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297932881] [2021-11-09 09:43:37,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:37,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:37,785 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:37,787 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:37,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:37,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-09 09:43:37,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1528, Unknown=0, NotChecked=0, Total=1640 [2021-11-09 09:43:37,837 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. cyclomatic complexity: 7 Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 states have internal predecessors, (81), 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-09 09:43:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:38,939 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-11-09 09:43:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-09 09:43:38,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 73 transitions. [2021-11-09 09:43:38,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:38,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 67 states and 71 transitions. [2021-11-09 09:43:38,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:38,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:38,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 71 transitions. [2021-11-09 09:43:38,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:38,942 INFO L681 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-11-09 09:43:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 71 transitions. [2021-11-09 09:43:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-11-09 09:43:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 65 states have internal predecessors, (70), 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-09 09:43:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-11-09 09:43:38,944 INFO L704 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-11-09 09:43:38,944 INFO L587 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-11-09 09:43:38,944 INFO L425 BuchiCegarLoop]: ======== Iteration 32============ [2021-11-09 09:43:38,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 70 transitions. [2021-11-09 09:43:38,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:38,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:38,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:38,946 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:38,946 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:38,947 INFO L791 eck$LassoCheckResult]: Stem: 7329#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7330#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 7341#L536 assume !(main_~length~0 < 1); 7331#L536-2 assume !(main_~n~1 < 1); 7332#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 7325#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 7326#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 7327#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 7328#L545-4 main_~i~1 := 0; 7335#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7336#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7337#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7338#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7344#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7390#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7389#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7388#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7387#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7386#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7385#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7384#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7383#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7382#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7381#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7380#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7379#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7378#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7377#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7376#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7375#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7374#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7373#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7372#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7371#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7370#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7369#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7368#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7367#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7366#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7365#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7364#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7363#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7362#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7361#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7360#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7359#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7358#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7357#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7356#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7355#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7354#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7353#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7352#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7351#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7350#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7349#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7348#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7347#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7346#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7345#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 7333#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 7334#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 7343#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 7342#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 7339#L528-2 [2021-11-09 09:43:38,947 INFO L793 eck$LassoCheckResult]: Loop: 7339#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 7340#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 7339#L528-2 [2021-11-09 09:43:38,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1237835971, now seen corresponding path program 25 times [2021-11-09 09:43:38,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:38,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921938016] [2021-11-09 09:43:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:38,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:39,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:39,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921938016] [2021-11-09 09:43:39,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921938016] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:39,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397240227] [2021-11-09 09:43:39,722 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-09 09:43:39,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:39,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:39,728 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:39,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2021-11-09 09:43:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:40,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-09 09:43:40,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:42,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397240227] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:42,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:42,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2021-11-09 09:43:42,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011599258] [2021-11-09 09:43:42,016 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:42,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:42,017 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 27 times [2021-11-09 09:43:42,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:42,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144378468] [2021-11-09 09:43:42,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:42,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:42,025 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:42,028 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:42,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:42,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-11-09 09:43:42,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=3063, Unknown=0, NotChecked=0, Total=3540 [2021-11-09 09:43:42,083 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. cyclomatic complexity: 7 Second operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 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-09 09:43:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:43,610 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2021-11-09 09:43:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-09 09:43:43,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 75 transitions. [2021-11-09 09:43:43,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:43,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 69 states and 73 transitions. [2021-11-09 09:43:43,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:43,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:43,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 73 transitions. [2021-11-09 09:43:43,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:43,612 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 73 transitions. [2021-11-09 09:43:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 73 transitions. [2021-11-09 09:43:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2021-11-09 09:43:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 67 states have internal predecessors, (72), 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-09 09:43:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2021-11-09 09:43:43,613 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 72 transitions. [2021-11-09 09:43:43,613 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 72 transitions. [2021-11-09 09:43:43,613 INFO L425 BuchiCegarLoop]: ======== Iteration 33============ [2021-11-09 09:43:43,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 72 transitions. [2021-11-09 09:43:43,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:43,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:43,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:43,615 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:43,615 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:43,615 INFO L791 eck$LassoCheckResult]: Stem: 7774#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7775#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 7786#L536 assume !(main_~length~0 < 1); 7776#L536-2 assume !(main_~n~1 < 1); 7777#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 7770#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 7771#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 7772#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 7773#L545-4 main_~i~1 := 0; 7780#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7781#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7782#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7783#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7789#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7837#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7836#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7835#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7834#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7833#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7832#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7831#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7830#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7829#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7828#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7827#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7826#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7825#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7824#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7823#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7822#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7821#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7820#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7819#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7818#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7817#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7816#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7815#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7814#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7813#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7812#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7811#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7810#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7809#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7808#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7807#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7806#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7805#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7804#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7803#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7802#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7801#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7800#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7799#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7798#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7797#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7796#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7795#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7794#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7793#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7792#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 7791#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 7790#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 7778#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 7779#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 7788#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 7787#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 7784#L528-2 [2021-11-09 09:43:43,615 INFO L793 eck$LassoCheckResult]: Loop: 7784#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 7785#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 7784#L528-2 [2021-11-09 09:43:43,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:43,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1776623707, now seen corresponding path program 26 times [2021-11-09 09:43:43,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:43,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190105009] [2021-11-09 09:43:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:43,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:44,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:44,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190105009] [2021-11-09 09:43:44,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190105009] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:44,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794751622] [2021-11-09 09:43:44,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-09 09:43:44,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:44,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:44,330 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:44,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2021-11-09 09:43:45,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-09 09:43:45,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:43:45,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-09 09:43:45,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:46,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794751622] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:46,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:46,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2021-11-09 09:43:46,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505048737] [2021-11-09 09:43:46,684 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:46,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 28 times [2021-11-09 09:43:46,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:46,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246016950] [2021-11-09 09:43:46,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:46,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:46,701 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:46,705 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:46,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:46,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-11-09 09:43:46,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3274, Unknown=0, NotChecked=0, Total=3782 [2021-11-09 09:43:46,758 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. cyclomatic complexity: 7 Second operand has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 62 states have internal predecessors, (128), 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-09 09:43:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:48,597 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-11-09 09:43:48,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-09 09:43:48,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 77 transitions. [2021-11-09 09:43:48,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:48,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 71 states and 75 transitions. [2021-11-09 09:43:48,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:48,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:48,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 75 transitions. [2021-11-09 09:43:48,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:48,600 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2021-11-09 09:43:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 75 transitions. [2021-11-09 09:43:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2021-11-09 09:43:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 69 states have internal predecessors, (74), 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-09 09:43:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2021-11-09 09:43:48,603 INFO L704 BuchiCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-11-09 09:43:48,603 INFO L587 BuchiCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-11-09 09:43:48,603 INFO L425 BuchiCegarLoop]: ======== Iteration 34============ [2021-11-09 09:43:48,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 74 transitions. [2021-11-09 09:43:48,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:48,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:48,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:48,605 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:48,605 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:48,605 INFO L791 eck$LassoCheckResult]: Stem: 8233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8234#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 8245#L536 assume !(main_~length~0 < 1); 8235#L536-2 assume !(main_~n~1 < 1); 8236#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 8229#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 8230#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 8231#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 8232#L545-4 main_~i~1 := 0; 8239#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8240#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8241#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8242#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8248#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8298#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8297#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8296#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8295#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8294#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8293#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8292#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8291#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8290#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8289#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8288#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8287#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8286#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8285#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8284#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8283#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8282#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8281#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8280#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8279#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8278#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8277#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8276#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8275#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8274#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8273#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8272#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8271#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8270#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8269#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8268#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8267#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8266#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8265#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8264#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8263#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8262#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8261#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8260#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8259#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8258#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8257#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8256#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8255#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8254#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8253#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8252#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8251#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8250#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8249#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 8237#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 8238#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 8247#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 8246#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 8243#L528-2 [2021-11-09 09:43:48,606 INFO L793 eck$LassoCheckResult]: Loop: 8243#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 8244#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 8243#L528-2 [2021-11-09 09:43:48,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:48,606 INFO L85 PathProgramCache]: Analyzing trace with hash -430550535, now seen corresponding path program 27 times [2021-11-09 09:43:48,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:48,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337680113] [2021-11-09 09:43:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:48,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:49,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:49,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337680113] [2021-11-09 09:43:49,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337680113] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:49,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81799011] [2021-11-09 09:43:49,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-09 09:43:49,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:49,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:49,524 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:49,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2021-11-09 09:43:54,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2021-11-09 09:43:54,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:43:54,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-09 09:43:54,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:43:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:56,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81799011] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:56,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:43:56,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 62 [2021-11-09 09:43:56,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379253568] [2021-11-09 09:43:56,124 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:43:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:56,124 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 29 times [2021-11-09 09:43:56,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:56,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37132711] [2021-11-09 09:43:56,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:56,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:56,132 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:43:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:43:56,135 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:43:56,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:43:56,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-11-09 09:43:56,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=3304, Unknown=0, NotChecked=0, Total=3782 [2021-11-09 09:43:56,177 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. cyclomatic complexity: 7 Second operand has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 62 states have internal predecessors, (123), 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-09 09:43:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:43:57,900 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2021-11-09 09:43:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-09 09:43:57,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 79 transitions. [2021-11-09 09:43:57,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:57,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 73 states and 77 transitions. [2021-11-09 09:43:57,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:43:57,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:43:57,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 77 transitions. [2021-11-09 09:43:57,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:43:57,903 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 77 transitions. [2021-11-09 09:43:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 77 transitions. [2021-11-09 09:43:57,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-11-09 09:43:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 71 states have internal predecessors, (76), 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-09 09:43:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2021-11-09 09:43:57,906 INFO L704 BuchiCegarLoop]: Abstraction has 72 states and 76 transitions. [2021-11-09 09:43:57,906 INFO L587 BuchiCegarLoop]: Abstraction has 72 states and 76 transitions. [2021-11-09 09:43:57,906 INFO L425 BuchiCegarLoop]: ======== Iteration 35============ [2021-11-09 09:43:57,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 76 transitions. [2021-11-09 09:43:57,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:43:57,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:43:57,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:43:57,908 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:43:57,908 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:43:57,908 INFO L791 eck$LassoCheckResult]: Stem: 8700#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8701#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 8712#L536 assume !(main_~length~0 < 1); 8702#L536-2 assume !(main_~n~1 < 1); 8703#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 8696#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 8697#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 8698#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 8699#L545-4 main_~i~1 := 0; 8706#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8707#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8708#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8709#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8715#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8767#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8766#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8765#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8764#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8763#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8762#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8761#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8760#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8759#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8758#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8757#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8756#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8755#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8754#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8753#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8752#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8751#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8750#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8749#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8748#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8747#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8746#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8745#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8744#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8743#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8742#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8741#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8740#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8739#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8738#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8737#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8736#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8735#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8734#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8733#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8732#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8731#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8730#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8729#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8728#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8727#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8726#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8725#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8724#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8723#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8722#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8721#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8720#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8719#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8718#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 8717#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 8716#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 8704#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 8705#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 8714#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 8713#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 8710#L528-2 [2021-11-09 09:43:57,909 INFO L793 eck$LassoCheckResult]: Loop: 8710#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 8711#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 8710#L528-2 [2021-11-09 09:43:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:43:57,909 INFO L85 PathProgramCache]: Analyzing trace with hash 188847127, now seen corresponding path program 28 times [2021-11-09 09:43:57,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:43:57,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016621415] [2021-11-09 09:43:57,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:43:57,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:43:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:43:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:43:58,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:43:58,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016621415] [2021-11-09 09:43:58,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016621415] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:43:58,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135242851] [2021-11-09 09:43:58,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-09 09:43:58,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:43:58,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:43:58,820 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:43:58,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2021-11-09 09:44:00,717 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-09 09:44:00,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:44:00,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-09 09:44:00,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:44:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:44:02,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135242851] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:44:02,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:44:02,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2021-11-09 09:44:02,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499086426] [2021-11-09 09:44:02,403 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:44:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:44:02,403 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 30 times [2021-11-09 09:44:02,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:44:02,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018534060] [2021-11-09 09:44:02,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:44:02,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:44:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:44:02,413 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:44:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:44:02,416 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:44:02,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:44:02,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-11-09 09:44:02,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=3717, Unknown=0, NotChecked=0, Total=4290 [2021-11-09 09:44:02,460 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. cyclomatic complexity: 7 Second operand has 66 states, 66 states have (on average 2.0454545454545454) internal successors, (135), 66 states have internal predecessors, (135), 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-09 09:44:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:44:04,362 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2021-11-09 09:44:04,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-09 09:44:04,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 81 transitions. [2021-11-09 09:44:04,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:44:04,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 75 states and 79 transitions. [2021-11-09 09:44:04,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:44:04,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:44:04,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 79 transitions. [2021-11-09 09:44:04,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:44:04,364 INFO L681 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2021-11-09 09:44:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 79 transitions. [2021-11-09 09:44:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2021-11-09 09:44:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.054054054054054) internal successors, (78), 73 states have internal predecessors, (78), 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-09 09:44:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2021-11-09 09:44:04,366 INFO L704 BuchiCegarLoop]: Abstraction has 74 states and 78 transitions. [2021-11-09 09:44:04,366 INFO L587 BuchiCegarLoop]: Abstraction has 74 states and 78 transitions. [2021-11-09 09:44:04,366 INFO L425 BuchiCegarLoop]: ======== Iteration 36============ [2021-11-09 09:44:04,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 78 transitions. [2021-11-09 09:44:04,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:44:04,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:44:04,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:44:04,367 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:44:04,368 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:44:04,368 INFO L791 eck$LassoCheckResult]: Stem: 9187#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9188#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 9199#L536 assume !(main_~length~0 < 1); 9189#L536-2 assume !(main_~n~1 < 1); 9190#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 9183#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 9184#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 9185#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 9186#L545-4 main_~i~1 := 0; 9193#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9194#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9195#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9196#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9202#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9256#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9255#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9254#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9253#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9252#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9251#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9250#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9249#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9248#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9247#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9246#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9245#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9244#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9243#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9242#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9241#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9240#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9239#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9238#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9237#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9236#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9235#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9234#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9233#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9232#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9231#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9230#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9229#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9228#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9227#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9226#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9225#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9224#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9223#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9222#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9221#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9220#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9219#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9218#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9217#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9216#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9215#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9214#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9213#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9212#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9211#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9210#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9209#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9208#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9207#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9206#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9205#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9204#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9203#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 9191#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 9192#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 9201#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 9200#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 9197#L528-2 [2021-11-09 09:44:04,368 INFO L793 eck$LassoCheckResult]: Loop: 9197#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 9198#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 9197#L528-2 [2021-11-09 09:44:04,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:44:04,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1570453835, now seen corresponding path program 29 times [2021-11-09 09:44:04,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:44:04,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93527962] [2021-11-09 09:44:04,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:44:04,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:44:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:44:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:44:05,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:44:05,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93527962] [2021-11-09 09:44:05,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93527962] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:44:05,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410047886] [2021-11-09 09:44:05,363 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-09 09:44:05,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:44:05,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:44:05,368 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:44:05,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2021-11-09 09:44:07,568 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2021-11-09 09:44:07,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:44:07,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-09 09:44:07,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:44:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:44:09,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410047886] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:44:09,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:44:09,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2021-11-09 09:44:09,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243269087] [2021-11-09 09:44:09,399 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:44:09,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:44:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 31 times [2021-11-09 09:44:09,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:44:09,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38198596] [2021-11-09 09:44:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:44:09,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:44:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:44:09,408 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:44:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:44:09,410 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:44:09,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:44:09,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-11-09 09:44:09,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=3949, Unknown=0, NotChecked=0, Total=4556 [2021-11-09 09:44:09,449 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. cyclomatic complexity: 7 Second operand has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 68 states have internal predecessors, (141), 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-09 09:44:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:44:11,525 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2021-11-09 09:44:11,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-09 09:44:11,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 83 transitions. [2021-11-09 09:44:11,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:44:11,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 77 states and 81 transitions. [2021-11-09 09:44:11,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:44:11,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:44:11,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 81 transitions. [2021-11-09 09:44:11,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:44:11,527 INFO L681 BuchiCegarLoop]: Abstraction has 77 states and 81 transitions. [2021-11-09 09:44:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 81 transitions. [2021-11-09 09:44:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2021-11-09 09:44:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 75 states have internal predecessors, (80), 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-09 09:44:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2021-11-09 09:44:11,530 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 80 transitions. [2021-11-09 09:44:11,530 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 80 transitions. [2021-11-09 09:44:11,530 INFO L425 BuchiCegarLoop]: ======== Iteration 37============ [2021-11-09 09:44:11,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 80 transitions. [2021-11-09 09:44:11,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:44:11,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:44:11,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:44:11,532 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:44:11,532 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:44:11,532 INFO L791 eck$LassoCheckResult]: Stem: 9688#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9689#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 9700#L536 assume !(main_~length~0 < 1); 9690#L536-2 assume !(main_~n~1 < 1); 9691#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 9684#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 9685#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 9686#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 9687#L545-4 main_~i~1 := 0; 9694#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9695#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9696#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9697#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9703#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9759#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9758#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9757#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9756#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9755#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9754#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9753#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9752#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9751#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9750#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9749#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9748#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9747#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9746#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9745#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9744#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9743#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9742#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9741#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9740#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9739#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9738#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9737#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9736#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9735#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9734#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9733#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9732#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9731#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9730#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9729#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9728#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9727#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9726#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9725#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9724#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9723#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9722#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9721#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9720#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9719#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9718#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9717#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9716#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9715#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9714#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9713#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9712#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9711#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9710#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9709#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9708#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9707#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9706#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 9705#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 9704#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 9692#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 9693#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 9702#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 9701#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 9698#L528-2 [2021-11-09 09:44:11,533 INFO L793 eck$LassoCheckResult]: Loop: 9698#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 9699#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 9698#L528-2 [2021-11-09 09:44:11,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:44:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash -41563693, now seen corresponding path program 30 times [2021-11-09 09:44:11,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:44:11,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911713718] [2021-11-09 09:44:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:44:11,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:44:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:44:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:44:12,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:44:12,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911713718] [2021-11-09 09:44:12,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911713718] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:44:12,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547062841] [2021-11-09 09:44:12,554 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-09 09:44:12,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:44:12,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:44:12,560 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:44:12,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2021-11-09 09:44:44,646 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2021-11-09 09:44:44,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:44:44,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-09 09:44:44,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:44:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:44:45,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547062841] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:44:45,314 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:44:45,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 39 [2021-11-09 09:44:45,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257587794] [2021-11-09 09:44:45,315 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:44:45,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:44:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 32 times [2021-11-09 09:44:45,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:44:45,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729763341] [2021-11-09 09:44:45,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:44:45,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:44:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:44:45,327 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:44:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:44:45,329 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:44:45,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:44:45,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-09 09:44:45,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1401, Unknown=0, NotChecked=0, Total=1482 [2021-11-09 09:44:45,374 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. cyclomatic complexity: 7 Second operand has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 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-09 09:44:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:44:46,539 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2021-11-09 09:44:46,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-09 09:44:46,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 85 transitions. [2021-11-09 09:44:46,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:44:46,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 79 states and 83 transitions. [2021-11-09 09:44:46,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:44:46,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:44:46,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 83 transitions. [2021-11-09 09:44:46,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:44:46,542 INFO L681 BuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2021-11-09 09:44:46,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 83 transitions. [2021-11-09 09:44:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2021-11-09 09:44:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 77 states have internal predecessors, (82), 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-09 09:44:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2021-11-09 09:44:46,545 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-11-09 09:44:46,545 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-11-09 09:44:46,545 INFO L425 BuchiCegarLoop]: ======== Iteration 38============ [2021-11-09 09:44:46,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 82 transitions. [2021-11-09 09:44:46,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:44:46,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:44:46,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:44:46,547 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:44:46,547 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:44:46,548 INFO L791 eck$LassoCheckResult]: Stem: 10110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10111#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 10122#L536 assume !(main_~length~0 < 1); 10112#L536-2 assume !(main_~n~1 < 1); 10113#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 10106#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 10107#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 10108#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 10109#L545-4 main_~i~1 := 0; 10116#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10117#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10118#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10119#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10125#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10183#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10182#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10181#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10180#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10179#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10178#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10177#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10176#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10175#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10174#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10173#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10172#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10171#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10170#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10169#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10168#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10167#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10166#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10165#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10164#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10163#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10162#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10161#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10160#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10159#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10158#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10157#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10156#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10155#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10154#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10153#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10152#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10151#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10150#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10149#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10148#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10147#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10146#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10145#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10144#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10143#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10142#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10141#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10140#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10139#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10138#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10137#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10136#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10135#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10134#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10133#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10132#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10131#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10130#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10129#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10128#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10127#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10126#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 10114#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 10115#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 10124#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 10123#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 10120#L528-2 [2021-11-09 09:44:46,548 INFO L793 eck$LassoCheckResult]: Loop: 10120#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 10121#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 10120#L528-2 [2021-11-09 09:44:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:44:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash 343047537, now seen corresponding path program 31 times [2021-11-09 09:44:46,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:44:46,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957126995] [2021-11-09 09:44:46,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:44:46,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:44:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:44:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:44:47,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:44:47,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957126995] [2021-11-09 09:44:47,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957126995] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:44:47,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657540422] [2021-11-09 09:44:47,507 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-09 09:44:47,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:44:47,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:44:47,508 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:44:47,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2021-11-09 09:44:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:44:48,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-09 09:44:48,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:44:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:44:50,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657540422] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:44:50,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:44:50,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 72 [2021-11-09 09:44:50,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675919910] [2021-11-09 09:44:50,796 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:44:50,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:44:50,797 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 33 times [2021-11-09 09:44:50,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:44:50,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15065174] [2021-11-09 09:44:50,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:44:50,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:44:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:44:50,805 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:44:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:44:50,808 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:44:50,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:44:50,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-11-09 09:44:50,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=4434, Unknown=0, NotChecked=0, Total=5112 [2021-11-09 09:44:50,849 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. cyclomatic complexity: 7 Second operand has 72 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 72 states have internal predecessors, (149), 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-09 09:44:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:44:53,231 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2021-11-09 09:44:53,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-09 09:44:53,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 87 transitions. [2021-11-09 09:44:53,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:44:53,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 81 states and 85 transitions. [2021-11-09 09:44:53,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:44:53,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:44:53,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 85 transitions. [2021-11-09 09:44:53,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:44:53,253 INFO L681 BuchiCegarLoop]: Abstraction has 81 states and 85 transitions. [2021-11-09 09:44:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 85 transitions. [2021-11-09 09:44:53,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2021-11-09 09:44:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.05) internal successors, (84), 79 states have internal predecessors, (84), 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-09 09:44:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2021-11-09 09:44:53,260 INFO L704 BuchiCegarLoop]: Abstraction has 80 states and 84 transitions. [2021-11-09 09:44:53,260 INFO L587 BuchiCegarLoop]: Abstraction has 80 states and 84 transitions. [2021-11-09 09:44:53,260 INFO L425 BuchiCegarLoop]: ======== Iteration 39============ [2021-11-09 09:44:53,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 84 transitions. [2021-11-09 09:44:53,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:44:53,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:44:53,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:44:53,262 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:44:53,262 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:44:53,262 INFO L791 eck$LassoCheckResult]: Stem: 10639#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10640#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 10651#L536 assume !(main_~length~0 < 1); 10641#L536-2 assume !(main_~n~1 < 1); 10642#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 10635#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 10636#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 10637#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 10638#L545-4 main_~i~1 := 0; 10645#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10646#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10647#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10648#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10654#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10714#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10713#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10712#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10711#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10710#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10709#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10708#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10707#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10706#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10705#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10704#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10703#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10702#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10701#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10700#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10699#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10698#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10697#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10696#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10695#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10694#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10693#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10692#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10691#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10690#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10689#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10688#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10687#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10686#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10685#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10684#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10683#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10682#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10681#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10680#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10679#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10678#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10677#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10676#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10675#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10674#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10673#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10672#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10671#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10670#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10669#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10668#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10667#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10666#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10665#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10664#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10663#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10662#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10661#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10660#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10659#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10658#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10657#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 10656#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 10655#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 10643#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 10644#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 10653#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 10652#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 10649#L528-2 [2021-11-09 09:44:53,262 INFO L793 eck$LassoCheckResult]: Loop: 10649#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 10650#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 10649#L528-2 [2021-11-09 09:44:53,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:44:53,263 INFO L85 PathProgramCache]: Analyzing trace with hash 587252111, now seen corresponding path program 32 times [2021-11-09 09:44:53,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:44:53,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227242422] [2021-11-09 09:44:53,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:44:53,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:44:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:44:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:44:54,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:44:54,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227242422] [2021-11-09 09:44:54,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227242422] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:44:54,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174941466] [2021-11-09 09:44:54,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-09 09:44:54,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:44:54,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:44:54,409 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:44:54,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2021-11-09 09:44:55,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-09 09:44:55,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:44:55,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-09 09:44:55,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:44:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:44:57,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174941466] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:44:57,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:44:57,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2021-11-09 09:44:57,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446561504] [2021-11-09 09:44:57,919 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:44:57,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:44:57,919 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 34 times [2021-11-09 09:44:57,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:44:57,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472369803] [2021-11-09 09:44:57,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:44:57,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:44:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:44:57,930 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:44:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:44:57,932 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:44:57,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:44:57,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-11-09 09:44:57,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=4687, Unknown=0, NotChecked=0, Total=5402 [2021-11-09 09:44:57,989 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. cyclomatic complexity: 7 Second operand has 74 states, 74 states have (on average 2.0405405405405403) internal successors, (151), 74 states have internal predecessors, (151), 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-09 09:45:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:45:00,602 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-11-09 09:45:00,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-11-09 09:45:00,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 89 transitions. [2021-11-09 09:45:00,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:45:00,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 83 states and 87 transitions. [2021-11-09 09:45:00,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:45:00,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:45:00,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 87 transitions. [2021-11-09 09:45:00,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:45:00,604 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 87 transitions. [2021-11-09 09:45:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 87 transitions. [2021-11-09 09:45:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2021-11-09 09:45:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.048780487804878) internal successors, (86), 81 states have internal predecessors, (86), 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-09 09:45:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2021-11-09 09:45:00,606 INFO L704 BuchiCegarLoop]: Abstraction has 82 states and 86 transitions. [2021-11-09 09:45:00,606 INFO L587 BuchiCegarLoop]: Abstraction has 82 states and 86 transitions. [2021-11-09 09:45:00,607 INFO L425 BuchiCegarLoop]: ======== Iteration 40============ [2021-11-09 09:45:00,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 86 transitions. [2021-11-09 09:45:00,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:45:00,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:45:00,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:45:00,608 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:45:00,608 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:45:00,608 INFO L791 eck$LassoCheckResult]: Stem: 11182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11183#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 11194#L536 assume !(main_~length~0 < 1); 11184#L536-2 assume !(main_~n~1 < 1); 11185#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 11178#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 11179#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 11180#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 11181#L545-4 main_~i~1 := 0; 11188#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11189#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11190#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11191#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11197#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11259#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11258#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11257#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11256#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11255#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11254#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11253#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11252#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11251#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11250#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11249#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11248#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11247#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11246#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11245#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11244#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11243#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11242#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11241#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11240#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11239#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11238#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11237#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11236#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11235#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11234#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11233#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11232#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11231#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11230#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11229#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11228#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11227#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11226#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11225#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11224#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11223#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11222#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11221#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11220#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11219#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11218#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11217#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11216#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11215#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11214#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11213#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11212#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11211#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11210#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11209#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11208#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11207#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11206#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11205#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11204#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11203#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11202#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11201#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11200#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11199#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11198#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 11186#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 11187#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 11196#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 11195#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 11192#L528-2 [2021-11-09 09:45:00,608 INFO L793 eck$LassoCheckResult]: Loop: 11192#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 11193#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 11192#L528-2 [2021-11-09 09:45:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:45:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash -955353555, now seen corresponding path program 33 times [2021-11-09 09:45:00,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:45:00,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591432161] [2021-11-09 09:45:00,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:45:00,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:45:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:45:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1090 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:45:01,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:45:01,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591432161] [2021-11-09 09:45:01,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591432161] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:45:01,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457628743] [2021-11-09 09:45:01,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-09 09:45:01,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:45:01,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:45:01,616 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:45:01,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2021-11-09 09:45:16,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2021-11-09 09:45:16,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:45:16,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 49 conjunts are in the unsatisfiable core [2021-11-09 09:45:16,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:45:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1090 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:45:19,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457628743] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:45:19,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:45:19,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 78 [2021-11-09 09:45:19,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098238195] [2021-11-09 09:45:19,108 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:45:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:45:19,108 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 35 times [2021-11-09 09:45:19,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:45:19,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58812011] [2021-11-09 09:45:19,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:45:19,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:45:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:45:19,119 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:45:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:45:19,121 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:45:19,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:45:19,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-11-09 09:45:19,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=5258, Unknown=0, NotChecked=0, Total=6006 [2021-11-09 09:45:19,163 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. cyclomatic complexity: 7 Second operand has 78 states, 78 states have (on average 2.0) internal successors, (156), 78 states have internal predecessors, (156), 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-09 09:45:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:45:23,616 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2021-11-09 09:45:23,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-11-09 09:45:23,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 91 transitions. [2021-11-09 09:45:23,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:45:23,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 85 states and 89 transitions. [2021-11-09 09:45:23,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:45:23,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:45:23,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 89 transitions. [2021-11-09 09:45:23,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:45:23,619 INFO L681 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2021-11-09 09:45:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 89 transitions. [2021-11-09 09:45:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2021-11-09 09:45:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 83 states have internal predecessors, (88), 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-09 09:45:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-11-09 09:45:23,629 INFO L704 BuchiCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-11-09 09:45:23,629 INFO L587 BuchiCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-11-09 09:45:23,629 INFO L425 BuchiCegarLoop]: ======== Iteration 41============ [2021-11-09 09:45:23,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 88 transitions. [2021-11-09 09:45:23,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:45:23,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:45:23,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:45:23,631 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:45:23,631 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:45:23,632 INFO L791 eck$LassoCheckResult]: Stem: 11797#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11798#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 11809#L536 assume !(main_~length~0 < 1); 11799#L536-2 assume !(main_~n~1 < 1); 11800#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 11793#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 11794#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 11795#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 11796#L545-4 main_~i~1 := 0; 11803#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11804#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11805#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11806#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11812#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11876#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11875#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11874#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11873#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11872#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11871#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11870#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11869#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11868#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11867#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11866#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11865#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11864#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11863#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11862#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11861#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11860#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11859#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11858#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11857#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11856#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11855#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11854#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11853#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11852#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11851#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11850#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11849#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11848#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11847#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11846#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11845#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11844#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11843#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11842#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11841#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11840#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11839#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11838#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11837#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11836#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11835#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11834#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11833#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11832#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11831#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11830#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11829#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11828#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11827#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11826#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11825#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11824#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11823#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11822#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11821#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11820#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11819#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11818#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11817#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11816#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11815#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 11814#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 11813#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 11801#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 11802#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 11811#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 11810#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 11807#L528-2 [2021-11-09 09:45:23,632 INFO L793 eck$LassoCheckResult]: Loop: 11807#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 11808#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 11807#L528-2 [2021-11-09 09:45:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:45:23,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1635681461, now seen corresponding path program 34 times [2021-11-09 09:45:23,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:45:23,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127208173] [2021-11-09 09:45:23,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:45:23,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:45:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:45:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:45:24,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:45:24,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127208173] [2021-11-09 09:45:24,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127208173] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:45:24,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403796656] [2021-11-09 09:45:24,770 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-09 09:45:24,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:45:24,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:45:24,772 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:45:24,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2021-11-09 09:45:26,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-09 09:45:26,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:45:26,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-09 09:45:26,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:45:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:45:29,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403796656] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:45:29,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:45:29,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 78 [2021-11-09 09:45:29,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342454091] [2021-11-09 09:45:29,413 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:45:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:45:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 36 times [2021-11-09 09:45:29,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:45:29,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934269455] [2021-11-09 09:45:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:45:29,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:45:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:45:29,424 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:45:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:45:29,427 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:45:29,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:45:29,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-11-09 09:45:29,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=5214, Unknown=0, NotChecked=0, Total=6006 [2021-11-09 09:45:29,484 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. cyclomatic complexity: 7 Second operand has 78 states, 78 states have (on average 2.051282051282051) internal successors, (160), 78 states have internal predecessors, (160), 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-09 09:45:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:45:32,270 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2021-11-09 09:45:32,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-09 09:45:32,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 93 transitions. [2021-11-09 09:45:32,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:45:32,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 87 states and 91 transitions. [2021-11-09 09:45:32,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:45:32,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:45:32,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 91 transitions. [2021-11-09 09:45:32,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:45:32,280 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 91 transitions. [2021-11-09 09:45:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 91 transitions. [2021-11-09 09:45:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2021-11-09 09:45:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 85 states have internal predecessors, (90), 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-09 09:45:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2021-11-09 09:45:32,284 INFO L704 BuchiCegarLoop]: Abstraction has 86 states and 90 transitions. [2021-11-09 09:45:32,284 INFO L587 BuchiCegarLoop]: Abstraction has 86 states and 90 transitions. [2021-11-09 09:45:32,284 INFO L425 BuchiCegarLoop]: ======== Iteration 42============ [2021-11-09 09:45:32,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 90 transitions. [2021-11-09 09:45:32,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:45:32,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:45:32,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:45:32,286 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:45:32,286 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:45:32,286 INFO L791 eck$LassoCheckResult]: Stem: 12368#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12369#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 12380#L536 assume !(main_~length~0 < 1); 12370#L536-2 assume !(main_~n~1 < 1); 12371#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 12364#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 12365#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 12366#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 12367#L545-4 main_~i~1 := 0; 12374#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12375#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12376#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12377#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12383#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12449#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12448#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12447#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12446#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12445#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12444#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12443#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12442#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12441#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12440#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12439#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12438#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12437#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12436#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12435#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12434#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12433#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12432#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12431#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12430#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12429#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12428#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12427#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12426#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12425#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12424#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12423#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12422#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12421#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12420#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12419#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12418#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12417#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12416#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12415#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12414#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12413#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12412#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12411#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12410#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12409#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12408#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12407#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12406#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12405#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12404#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12403#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12402#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12401#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12400#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12399#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12398#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12397#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12396#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12395#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12394#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12393#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12392#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12391#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12390#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12389#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12388#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12387#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12386#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12385#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12384#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 12372#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 12373#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 12382#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 12381#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 12378#L528-2 [2021-11-09 09:45:32,287 INFO L793 eck$LassoCheckResult]: Loop: 12378#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 12379#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 12378#L528-2 [2021-11-09 09:45:32,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:45:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1699197161, now seen corresponding path program 35 times [2021-11-09 09:45:32,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:45:32,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977493721] [2021-11-09 09:45:32,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:45:32,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:45:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:45:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:45:33,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:45:33,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977493721] [2021-11-09 09:45:33,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977493721] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:45:33,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164191427] [2021-11-09 09:45:33,385 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-09 09:45:33,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:45:33,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:45:33,387 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:45:33,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2021-11-09 09:45:36,252 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2021-11-09 09:45:36,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:45:36,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-09 09:45:36,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:45:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:45:39,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164191427] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:45:39,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:45:39,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40] total 80 [2021-11-09 09:45:39,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599652972] [2021-11-09 09:45:39,068 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:45:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:45:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 37 times [2021-11-09 09:45:39,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:45:39,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798799891] [2021-11-09 09:45:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:45:39,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:45:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:45:39,098 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:45:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:45:39,101 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:45:39,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:45:39,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-11-09 09:45:39,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=832, Invalid=5488, Unknown=0, NotChecked=0, Total=6320 [2021-11-09 09:45:39,157 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. cyclomatic complexity: 7 Second operand has 80 states, 80 states have (on average 2.0625) internal successors, (165), 80 states have internal predecessors, (165), 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-09 09:45:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:45:42,123 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-11-09 09:45:42,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-09 09:45:42,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 95 transitions. [2021-11-09 09:45:42,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:45:42,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 89 states and 93 transitions. [2021-11-09 09:45:42,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:45:42,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:45:42,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 93 transitions. [2021-11-09 09:45:42,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:45:42,127 INFO L681 BuchiCegarLoop]: Abstraction has 89 states and 93 transitions. [2021-11-09 09:45:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 93 transitions. [2021-11-09 09:45:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-11-09 09:45:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 87 states have internal predecessors, (92), 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-09 09:45:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2021-11-09 09:45:42,130 INFO L704 BuchiCegarLoop]: Abstraction has 88 states and 92 transitions. [2021-11-09 09:45:42,130 INFO L587 BuchiCegarLoop]: Abstraction has 88 states and 92 transitions. [2021-11-09 09:45:42,130 INFO L425 BuchiCegarLoop]: ======== Iteration 43============ [2021-11-09 09:45:42,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 92 transitions. [2021-11-09 09:45:42,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:45:42,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:45:42,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:45:42,155 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:45:42,155 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:45:42,156 INFO L791 eck$LassoCheckResult]: Stem: 12953#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12954#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 12965#L536 assume !(main_~length~0 < 1); 12955#L536-2 assume !(main_~n~1 < 1); 12956#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 12949#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 12950#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 12951#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 12952#L545-4 main_~i~1 := 0; 12959#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12960#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12961#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12962#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12968#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13036#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13035#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13034#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13033#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13032#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13031#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13030#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13029#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13028#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13027#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13026#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13025#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13024#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13023#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13022#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13021#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13020#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13019#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13018#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13017#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13016#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13015#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13014#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13013#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13012#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13011#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13010#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13009#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13008#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13007#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13006#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13005#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13004#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13003#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13002#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13001#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13000#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12999#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12998#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12997#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12996#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12995#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12994#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12993#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12992#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12991#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12990#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12989#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12988#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12987#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12986#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12985#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12984#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12983#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12982#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12981#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12980#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12979#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12978#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12977#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12976#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12975#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12974#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12973#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12972#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12971#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 12970#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 12969#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 12957#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 12958#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 12967#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 12966#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 12963#L528-2 [2021-11-09 09:45:42,157 INFO L793 eck$LassoCheckResult]: Loop: 12963#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 12964#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 12963#L528-2 [2021-11-09 09:45:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:45:42,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1823017209, now seen corresponding path program 36 times [2021-11-09 09:45:42,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:45:42,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156641042] [2021-11-09 09:45:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:45:42,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:45:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:45:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:45:43,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:45:43,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156641042] [2021-11-09 09:45:43,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156641042] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:45:43,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969664757] [2021-11-09 09:45:43,561 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-09 09:45:43,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:45:43,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:45:43,563 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:45:43,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2021-11-09 09:47:18,362 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2021-11-09 09:47:18,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:47:18,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 81 conjunts are in the unsatisfiable core [2021-11-09 09:47:18,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:47:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:47:19,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969664757] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:47:19,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:47:19,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 45 [2021-11-09 09:47:19,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034155010] [2021-11-09 09:47:19,141 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:47:19,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:47:19,141 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 38 times [2021-11-09 09:47:19,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:47:19,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874854827] [2021-11-09 09:47:19,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:47:19,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:47:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:47:19,163 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:47:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:47:19,166 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:47:19,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:47:19,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-11-09 09:47:19,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1888, Unknown=0, NotChecked=0, Total=1980 [2021-11-09 09:47:19,218 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. cyclomatic complexity: 7 Second operand has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 45 states have internal predecessors, (93), 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-09 09:47:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:47:20,989 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2021-11-09 09:47:20,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-09 09:47:20,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 97 transitions. [2021-11-09 09:47:20,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:47:20,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 91 states and 95 transitions. [2021-11-09 09:47:20,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:47:20,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:47:20,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 95 transitions. [2021-11-09 09:47:20,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:47:20,991 INFO L681 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2021-11-09 09:47:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 95 transitions. [2021-11-09 09:47:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2021-11-09 09:47:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 89 states have internal predecessors, (94), 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-09 09:47:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2021-11-09 09:47:20,994 INFO L704 BuchiCegarLoop]: Abstraction has 90 states and 94 transitions. [2021-11-09 09:47:20,994 INFO L587 BuchiCegarLoop]: Abstraction has 90 states and 94 transitions. [2021-11-09 09:47:20,994 INFO L425 BuchiCegarLoop]: ======== Iteration 44============ [2021-11-09 09:47:20,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 94 transitions. [2021-11-09 09:47:20,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:47:20,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:47:20,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:47:20,997 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:47:20,997 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:47:20,997 INFO L791 eck$LassoCheckResult]: Stem: 13441#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13442#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 13453#L536 assume !(main_~length~0 < 1); 13443#L536-2 assume !(main_~n~1 < 1); 13444#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 13437#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 13438#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 13439#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 13440#L545-4 main_~i~1 := 0; 13447#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13448#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13449#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13450#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13456#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13526#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13525#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13524#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13523#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13522#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13521#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13520#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13519#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13518#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13517#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13516#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13515#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13514#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13513#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13512#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13511#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13510#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13509#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13508#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13507#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13506#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13505#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13504#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13503#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13502#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13501#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13500#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13499#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13498#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13497#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13496#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13495#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13494#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13493#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13492#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13491#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13490#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13489#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13488#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13487#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13486#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13485#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13484#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13483#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13482#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13481#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13480#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13479#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13478#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13477#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13476#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13475#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13474#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13473#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13472#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13471#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13470#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13469#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13468#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13467#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13466#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13465#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13464#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13463#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13462#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13461#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13460#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13459#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 13458#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 13457#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 13445#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 13446#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 13455#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 13454#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 13451#L528-2 [2021-11-09 09:47:20,997 INFO L793 eck$LassoCheckResult]: Loop: 13451#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 13452#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 13451#L528-2 [2021-11-09 09:47:20,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:47:20,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2058169765, now seen corresponding path program 37 times [2021-11-09 09:47:20,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:47:20,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287149714] [2021-11-09 09:47:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:47:20,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:47:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:47:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:47:22,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:47:22,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287149714] [2021-11-09 09:47:22,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287149714] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:47:22,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674535195] [2021-11-09 09:47:22,339 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-09 09:47:22,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:47:22,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:47:22,341 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:47:22,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2021-11-09 09:47:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:47:23,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-09 09:47:23,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:47:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:47:26,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674535195] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:47:26,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:47:26,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42] total 84 [2021-11-09 09:47:26,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073408867] [2021-11-09 09:47:26,767 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:47:26,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:47:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 39 times [2021-11-09 09:47:26,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:47:26,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685275819] [2021-11-09 09:47:26,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:47:26,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:47:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:47:26,780 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:47:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:47:26,782 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:47:26,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:47:26,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-11-09 09:47:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=915, Invalid=6057, Unknown=0, NotChecked=0, Total=6972 [2021-11-09 09:47:26,821 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. cyclomatic complexity: 7 Second operand has 84 states, 84 states have (on average 2.0595238095238093) internal successors, (173), 84 states have internal predecessors, (173), 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-09 09:47:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:47:29,937 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2021-11-09 09:47:29,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-09 09:47:29,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 99 transitions. [2021-11-09 09:47:29,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:47:29,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 93 states and 97 transitions. [2021-11-09 09:47:29,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:47:29,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:47:29,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 97 transitions. [2021-11-09 09:47:29,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:47:29,939 INFO L681 BuchiCegarLoop]: Abstraction has 93 states and 97 transitions. [2021-11-09 09:47:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 97 transitions. [2021-11-09 09:47:29,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2021-11-09 09:47:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 91 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:47:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2021-11-09 09:47:29,941 INFO L704 BuchiCegarLoop]: Abstraction has 92 states and 96 transitions. [2021-11-09 09:47:29,941 INFO L587 BuchiCegarLoop]: Abstraction has 92 states and 96 transitions. [2021-11-09 09:47:29,941 INFO L425 BuchiCegarLoop]: ======== Iteration 45============ [2021-11-09 09:47:29,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 96 transitions. [2021-11-09 09:47:29,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:47:29,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:47:29,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:47:29,942 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:47:29,943 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:47:29,943 INFO L791 eck$LassoCheckResult]: Stem: 14054#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14055#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 14066#L536 assume !(main_~length~0 < 1); 14056#L536-2 assume !(main_~n~1 < 1); 14057#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 14050#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 14051#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 14052#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 14053#L545-4 main_~i~1 := 0; 14060#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14061#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14062#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14063#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14069#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14141#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14140#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14139#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14138#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14137#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14136#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14135#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14134#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14133#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14132#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14131#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14130#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14129#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14128#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14127#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14126#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14125#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14124#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14123#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14122#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14121#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14120#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14119#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14118#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14117#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14116#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14115#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14114#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14113#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14112#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14111#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14110#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14109#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14108#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14107#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14106#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14105#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14104#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14103#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14102#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14101#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14100#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14099#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14098#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14097#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14096#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14095#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14094#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14093#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14092#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14091#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14090#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14089#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14088#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14087#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14086#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14085#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14084#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14083#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14082#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14081#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14080#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14079#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14078#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14077#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14076#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14075#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14074#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14073#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14072#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14071#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14070#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 14058#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 14059#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 14068#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 14067#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 14064#L528-2 [2021-11-09 09:47:29,943 INFO L793 eck$LassoCheckResult]: Loop: 14064#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 14065#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 14064#L528-2 [2021-11-09 09:47:29,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:47:29,943 INFO L85 PathProgramCache]: Analyzing trace with hash -447728445, now seen corresponding path program 38 times [2021-11-09 09:47:29,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:47:29,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427678467] [2021-11-09 09:47:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:47:29,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:47:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:47:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:47:31,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:47:31,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427678467] [2021-11-09 09:47:31,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427678467] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:47:31,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975693424] [2021-11-09 09:47:31,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-09 09:47:31,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:47:31,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:47:31,276 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:47:31,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2021-11-09 09:47:32,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-09 09:47:32,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:47:32,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-09 09:47:32,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:47:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:47:35,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975693424] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:47:35,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:47:35,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 86 [2021-11-09 09:47:35,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399786699] [2021-11-09 09:47:35,928 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:47:35,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:47:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 40 times [2021-11-09 09:47:35,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:47:35,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396971077] [2021-11-09 09:47:35,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:47:35,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:47:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:47:35,941 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:47:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:47:35,944 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:47:36,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:47:36,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-11-09 09:47:36,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=958, Invalid=6352, Unknown=0, NotChecked=0, Total=7310 [2021-11-09 09:47:36,007 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. cyclomatic complexity: 7 Second operand has 86 states, 86 states have (on average 2.0348837209302326) internal successors, (175), 86 states have internal predecessors, (175), 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-09 09:47:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:47:39,400 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2021-11-09 09:47:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-09 09:47:39,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 101 transitions. [2021-11-09 09:47:39,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:47:39,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 95 states and 99 transitions. [2021-11-09 09:47:39,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:47:39,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:47:39,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 99 transitions. [2021-11-09 09:47:39,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:47:39,403 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 99 transitions. [2021-11-09 09:47:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 99 transitions. [2021-11-09 09:47:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2021-11-09 09:47:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 93 states have internal predecessors, (98), 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-09 09:47:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-11-09 09:47:39,405 INFO L704 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-11-09 09:47:39,405 INFO L587 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-11-09 09:47:39,405 INFO L425 BuchiCegarLoop]: ======== Iteration 46============ [2021-11-09 09:47:39,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 98 transitions. [2021-11-09 09:47:39,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:47:39,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:47:39,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:47:39,407 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:47:39,407 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:47:39,408 INFO L791 eck$LassoCheckResult]: Stem: 14681#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14682#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 14693#L536 assume !(main_~length~0 < 1); 14683#L536-2 assume !(main_~n~1 < 1); 14684#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 14677#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 14678#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 14679#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 14680#L545-4 main_~i~1 := 0; 14687#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14688#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14689#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14690#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14696#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14770#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14769#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14768#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14767#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14766#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14765#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14764#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14763#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14762#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14761#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14760#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14759#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14758#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14757#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14756#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14755#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14754#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14753#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14752#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14751#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14750#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14749#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14748#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14747#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14746#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14745#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14744#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14743#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14742#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14741#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14740#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14739#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14738#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14737#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14736#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14735#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14734#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14733#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14732#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14731#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14730#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14729#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14728#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14727#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14726#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14725#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14724#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14723#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14722#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14721#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14720#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14719#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14718#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14717#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14716#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14715#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14714#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14713#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14712#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14711#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14710#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14709#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14708#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14707#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14706#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14705#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14704#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14703#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14702#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14701#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14700#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14699#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 14698#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 14697#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 14685#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 14686#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 14695#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 14694#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 14691#L528-2 [2021-11-09 09:47:39,408 INFO L793 eck$LassoCheckResult]: Loop: 14691#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 14692#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 14691#L528-2 [2021-11-09 09:47:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:47:39,409 INFO L85 PathProgramCache]: Analyzing trace with hash 860744801, now seen corresponding path program 39 times [2021-11-09 09:47:39,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:47:39,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030525461] [2021-11-09 09:47:39,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:47:39,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:47:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:47:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1522 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:47:40,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:47:40,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030525461] [2021-11-09 09:47:40,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030525461] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:47:40,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388880694] [2021-11-09 09:47:40,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-09 09:47:40,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:47:40,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:47:40,995 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:47:41,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2021-11-09 09:49:35,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2021-11-09 09:49:35,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:49:35,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-09 09:49:35,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:49:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1522 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:49:38,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388880694] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:49:38,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:49:38,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 87 [2021-11-09 09:49:38,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992985471] [2021-11-09 09:49:38,194 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:49:38,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:38,194 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 41 times [2021-11-09 09:49:38,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:38,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282345870] [2021-11-09 09:49:38,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:38,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:49:38,211 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:49:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:49:38,213 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:49:38,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:38,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2021-11-09 09:49:38,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=957, Invalid=6525, Unknown=0, NotChecked=0, Total=7482 [2021-11-09 09:49:38,253 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. cyclomatic complexity: 7 Second operand has 87 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 87 states have internal predecessors, (173), 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-09 09:49:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:49:41,127 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2021-11-09 09:49:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-09 09:49:41,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 103 transitions. [2021-11-09 09:49:41,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:49:41,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 97 states and 101 transitions. [2021-11-09 09:49:41,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:49:41,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:49:41,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 101 transitions. [2021-11-09 09:49:41,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:41,130 INFO L681 BuchiCegarLoop]: Abstraction has 97 states and 101 transitions. [2021-11-09 09:49:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 101 transitions. [2021-11-09 09:49:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2021-11-09 09:49:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 95 states have internal predecessors, (100), 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-09 09:49:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2021-11-09 09:49:41,136 INFO L704 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2021-11-09 09:49:41,136 INFO L587 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2021-11-09 09:49:41,136 INFO L425 BuchiCegarLoop]: ======== Iteration 47============ [2021-11-09 09:49:41,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 100 transitions. [2021-11-09 09:49:41,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:49:41,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:49:41,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:49:41,138 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:49:41,138 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:49:41,139 INFO L791 eck$LassoCheckResult]: Stem: 15319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 15320#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 15331#L536 assume !(main_~length~0 < 1); 15321#L536-2 assume !(main_~n~1 < 1); 15322#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 15315#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 15316#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 15317#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 15318#L545-4 main_~i~1 := 0; 15325#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15326#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15327#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15328#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15334#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15410#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15409#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15408#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15407#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15406#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15405#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15404#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15403#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15402#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15401#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15400#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15399#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15398#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15397#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15396#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15395#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15394#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15393#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15392#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15391#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15390#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15389#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15388#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15387#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15386#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15385#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15384#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15383#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15382#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15381#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15380#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15379#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15378#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15377#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15376#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15375#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15374#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15373#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15372#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15371#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15370#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15369#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15368#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15367#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15366#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15365#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15364#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15363#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15362#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15361#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15360#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15359#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15358#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15357#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15356#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15355#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15354#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15353#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15352#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15351#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15350#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15349#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15348#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15347#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15346#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15345#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15344#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15343#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15342#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15341#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15340#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15339#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15338#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15337#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15336#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15335#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 15323#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 15324#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 15333#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 15332#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 15329#L528-2 [2021-11-09 09:49:41,139 INFO L793 eck$LassoCheckResult]: Loop: 15329#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 15330#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 15329#L528-2 [2021-11-09 09:49:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:41,140 INFO L85 PathProgramCache]: Analyzing trace with hash -121883521, now seen corresponding path program 40 times [2021-11-09 09:49:41,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:41,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207286688] [2021-11-09 09:49:41,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:41,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:49:42,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:42,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207286688] [2021-11-09 09:49:42,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207286688] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:49:42,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003699083] [2021-11-09 09:49:42,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-09 09:49:42,434 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:49:42,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:49:42,435 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:49:42,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2021-11-09 09:49:44,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-09 09:49:44,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:49:44,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-09 09:49:44,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:49:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1601 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:49:47,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003699083] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:49:47,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:49:47,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45] total 90 [2021-11-09 09:49:47,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433309130] [2021-11-09 09:49:47,720 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:49:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:47,721 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 42 times [2021-11-09 09:49:47,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:47,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889505007] [2021-11-09 09:49:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:47,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:49:47,746 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:49:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:49:47,748 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:49:47,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:49:47,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2021-11-09 09:49:47,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1047, Invalid=6963, Unknown=0, NotChecked=0, Total=8010 [2021-11-09 09:49:47,782 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. cyclomatic complexity: 7 Second operand has 90 states, 90 states have (on average 2.0555555555555554) internal successors, (185), 90 states have internal predecessors, (185), 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-09 09:49:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:49:50,882 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2021-11-09 09:49:50,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-09 09:49:50,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 105 transitions. [2021-11-09 09:49:50,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:49:50,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 99 states and 103 transitions. [2021-11-09 09:49:50,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:49:50,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:49:50,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 103 transitions. [2021-11-09 09:49:50,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:49:50,885 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 103 transitions. [2021-11-09 09:49:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 103 transitions. [2021-11-09 09:49:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-11-09 09:49:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 97 states have internal predecessors, (102), 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-09 09:49:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2021-11-09 09:49:50,887 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 102 transitions. [2021-11-09 09:49:50,887 INFO L587 BuchiCegarLoop]: Abstraction has 98 states and 102 transitions. [2021-11-09 09:49:50,888 INFO L425 BuchiCegarLoop]: ======== Iteration 48============ [2021-11-09 09:49:50,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 102 transitions. [2021-11-09 09:49:50,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:49:50,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:49:50,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:49:50,889 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:49:50,889 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:49:50,890 INFO L791 eck$LassoCheckResult]: Stem: 15974#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 15975#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 15986#L536 assume !(main_~length~0 < 1); 15976#L536-2 assume !(main_~n~1 < 1); 15977#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 15970#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 15971#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 15972#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 15973#L545-4 main_~i~1 := 0; 15980#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15981#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15982#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15983#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15989#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16067#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16066#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16065#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16064#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16063#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16062#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16061#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16060#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16059#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16058#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16057#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16056#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16055#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16054#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16053#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16052#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16051#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16050#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16049#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16048#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16047#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16046#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16045#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16044#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16043#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16042#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16041#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16040#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16039#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16038#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16037#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16036#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16035#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16034#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16033#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16032#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16031#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16030#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16029#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16028#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16027#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16026#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16025#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16024#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16023#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16022#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16021#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16020#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16019#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16018#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16017#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16016#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16015#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16014#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16013#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16012#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16011#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16010#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16009#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16008#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16007#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16006#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16005#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16004#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16003#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16002#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16001#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16000#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15999#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15998#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15997#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15996#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15995#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15994#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15993#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15992#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 15991#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 15990#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 15978#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 15979#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 15988#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 15987#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 15984#L528-2 [2021-11-09 09:49:50,890 INFO L793 eck$LassoCheckResult]: Loop: 15984#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 15985#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 15984#L528-2 [2021-11-09 09:49:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:49:50,890 INFO L85 PathProgramCache]: Analyzing trace with hash 465104157, now seen corresponding path program 41 times [2021-11-09 09:49:50,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:49:50,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085701136] [2021-11-09 09:49:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:49:50,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:49:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:49:52,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:49:52,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085701136] [2021-11-09 09:49:52,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085701136] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:49:52,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088961255] [2021-11-09 09:49:52,204 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-09 09:49:52,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:49:52,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:49:52,205 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:49:52,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2021-11-09 09:50:03,003 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2021-11-09 09:50:03,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:50:03,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-09 09:50:03,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:50:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:50:06,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088961255] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:50:06,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:50:06,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 92 [2021-11-09 09:50:06,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712730475] [2021-11-09 09:50:06,168 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:50:06,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:50:06,169 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 43 times [2021-11-09 09:50:06,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:50:06,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686314971] [2021-11-09 09:50:06,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:50:06,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:50:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:50:06,180 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:50:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:50:06,182 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:50:06,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:50:06,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2021-11-09 09:50:06,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1093, Invalid=7279, Unknown=0, NotChecked=0, Total=8372 [2021-11-09 09:50:06,219 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. cyclomatic complexity: 7 Second operand has 92 states, 92 states have (on average 2.032608695652174) internal successors, (187), 92 states have internal predecessors, (187), 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-09 09:50:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:50:09,534 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2021-11-09 09:50:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-09 09:50:09,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 107 transitions. [2021-11-09 09:50:09,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:50:09,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 101 states and 105 transitions. [2021-11-09 09:50:09,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:50:09,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:50:09,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 105 transitions. [2021-11-09 09:50:09,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:50:09,537 INFO L681 BuchiCegarLoop]: Abstraction has 101 states and 105 transitions. [2021-11-09 09:50:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 105 transitions. [2021-11-09 09:50:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2021-11-09 09:50:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.04) internal successors, (104), 99 states have internal predecessors, (104), 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-09 09:50:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2021-11-09 09:50:09,540 INFO L704 BuchiCegarLoop]: Abstraction has 100 states and 104 transitions. [2021-11-09 09:50:09,540 INFO L587 BuchiCegarLoop]: Abstraction has 100 states and 104 transitions. [2021-11-09 09:50:09,540 INFO L425 BuchiCegarLoop]: ======== Iteration 49============ [2021-11-09 09:50:09,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 104 transitions. [2021-11-09 09:50:09,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:50:09,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:50:09,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:50:09,543 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:50:09,543 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:50:09,543 INFO L791 eck$LassoCheckResult]: Stem: 16643#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 16644#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 16655#L536 assume !(main_~length~0 < 1); 16645#L536-2 assume !(main_~n~1 < 1); 16646#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 16639#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 16640#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 16641#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 16642#L545-4 main_~i~1 := 0; 16649#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16650#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16651#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16652#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16658#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16738#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16737#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16736#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16735#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16734#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16733#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16732#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16731#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16730#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16729#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16728#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16727#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16726#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16725#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16724#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16723#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16722#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16721#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16720#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16719#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16718#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16717#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16716#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16715#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16714#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16713#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16712#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16711#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16710#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16709#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16708#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16707#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16706#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16705#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16704#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16703#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16702#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16701#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16700#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16699#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16698#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16697#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16696#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16695#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16694#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16693#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16692#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16691#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16690#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16689#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16688#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16687#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16686#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16685#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16684#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16683#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16682#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16681#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16680#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16679#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16678#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16677#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16676#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16675#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16674#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16673#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16672#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16671#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16670#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16669#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16668#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16667#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16666#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16665#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16664#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16663#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16662#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16661#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 16660#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 16659#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 16647#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 16648#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 16657#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 16656#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 16653#L528-2 [2021-11-09 09:50:09,543 INFO L793 eck$LassoCheckResult]: Loop: 16653#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 16654#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 16653#L528-2 [2021-11-09 09:50:09,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:50:09,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1919546939, now seen corresponding path program 42 times [2021-11-09 09:50:09,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:50:09,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479645577] [2021-11-09 09:50:09,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:50:09,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:50:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:50:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1765 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:50:10,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:50:10,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479645577] [2021-11-09 09:50:10,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479645577] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:50:10,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070266554] [2021-11-09 09:50:10,822 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-09 09:50:10,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:50:10,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:50:10,823 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:50:10,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2021-11-09 09:53:32,814 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2021-11-09 09:53:32,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:53:32,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 95 conjunts are in the unsatisfiable core [2021-11-09 09:53:32,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:53:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1765 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:53:33,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070266554] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:53:33,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:53:33,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 51 [2021-11-09 09:53:33,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964793775] [2021-11-09 09:53:33,630 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:53:33,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:53:33,630 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 44 times [2021-11-09 09:53:33,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:53:33,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765131550] [2021-11-09 09:53:33,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:53:33,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:53:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:53:33,641 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:53:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:53:33,642 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:53:33,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:53:33,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-09 09:53:33,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2445, Unknown=0, NotChecked=0, Total=2550 [2021-11-09 09:53:33,674 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. cyclomatic complexity: 7 Second operand has 51 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 51 states have internal predecessors, (104), 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-09 09:53:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:53:35,376 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2021-11-09 09:53:35,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-09 09:53:35,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 109 transitions. [2021-11-09 09:53:35,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:53:35,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 103 states and 107 transitions. [2021-11-09 09:53:35,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:53:35,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:53:35,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 107 transitions. [2021-11-09 09:53:35,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:53:35,379 INFO L681 BuchiCegarLoop]: Abstraction has 103 states and 107 transitions. [2021-11-09 09:53:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 107 transitions. [2021-11-09 09:53:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2021-11-09 09:53:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 101 states have internal predecessors, (106), 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-09 09:53:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2021-11-09 09:53:35,382 INFO L704 BuchiCegarLoop]: Abstraction has 102 states and 106 transitions. [2021-11-09 09:53:35,382 INFO L587 BuchiCegarLoop]: Abstraction has 102 states and 106 transitions. [2021-11-09 09:53:35,382 INFO L425 BuchiCegarLoop]: ======== Iteration 50============ [2021-11-09 09:53:35,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 106 transitions. [2021-11-09 09:53:35,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:53:35,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:53:35,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:53:35,384 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:53:35,384 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:53:35,384 INFO L791 eck$LassoCheckResult]: Stem: 17197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 17198#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 17209#L536 assume !(main_~length~0 < 1); 17199#L536-2 assume !(main_~n~1 < 1); 17200#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 17193#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 17194#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 17195#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 17196#L545-4 main_~i~1 := 0; 17203#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17204#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17205#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17206#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17212#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17294#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17293#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17292#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17291#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17290#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17289#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17288#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17287#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17286#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17285#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17284#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17283#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17282#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17281#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17280#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17279#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17278#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17277#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17276#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17275#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17274#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17273#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17272#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17271#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17270#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17269#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17268#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17267#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17266#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17265#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17264#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17263#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17262#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17261#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17260#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17259#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17258#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17257#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17256#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17255#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17254#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17253#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17252#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17251#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17250#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17249#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17248#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17247#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17246#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17245#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17244#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17243#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17242#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17241#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17240#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17239#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17238#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17237#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17236#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17235#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17234#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17233#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17232#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17231#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17230#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17229#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17228#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17227#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17226#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17225#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17224#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17223#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17222#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17221#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17220#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17219#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17218#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17217#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17216#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17215#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17214#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17213#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 17201#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 17202#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 17211#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 17210#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 17207#L528-2 [2021-11-09 09:53:35,384 INFO L793 eck$LassoCheckResult]: Loop: 17207#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 17208#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 17207#L528-2 [2021-11-09 09:53:35,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:53:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash -520278055, now seen corresponding path program 43 times [2021-11-09 09:53:35,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:53:35,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452665118] [2021-11-09 09:53:35,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:53:35,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:53:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:53:36,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:53:36,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452665118] [2021-11-09 09:53:36,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452665118] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:53:36,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092428052] [2021-11-09 09:53:36,706 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-09 09:53:36,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:53:36,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:53:36,707 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:53:36,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2021-11-09 09:53:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:38,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 51 conjunts are in the unsatisfiable core [2021-11-09 09:53:38,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:53:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:53:41,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092428052] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:53:41,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:53:41,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48] total 96 [2021-11-09 09:53:41,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870808239] [2021-11-09 09:53:41,684 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:53:41,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:53:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 45 times [2021-11-09 09:53:41,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:53:41,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982545844] [2021-11-09 09:53:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:53:41,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:53:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:53:41,697 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:53:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:53:41,699 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:53:41,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:53:41,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-11-09 09:53:41,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1188, Invalid=7932, Unknown=0, NotChecked=0, Total=9120 [2021-11-09 09:53:41,750 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. cyclomatic complexity: 7 Second operand has 96 states, 96 states have (on average 2.0520833333333335) internal successors, (197), 96 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:53:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:53:45,562 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2021-11-09 09:53:45,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-09 09:53:45,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 111 transitions. [2021-11-09 09:53:45,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:53:45,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 105 states and 109 transitions. [2021-11-09 09:53:45,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:53:45,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:53:45,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 109 transitions. [2021-11-09 09:53:45,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:53:45,565 INFO L681 BuchiCegarLoop]: Abstraction has 105 states and 109 transitions. [2021-11-09 09:53:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 109 transitions. [2021-11-09 09:53:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2021-11-09 09:53:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 103 states have internal predecessors, (108), 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-09 09:53:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2021-11-09 09:53:45,566 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 108 transitions. [2021-11-09 09:53:45,566 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 108 transitions. [2021-11-09 09:53:45,566 INFO L425 BuchiCegarLoop]: ======== Iteration 51============ [2021-11-09 09:53:45,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 108 transitions. [2021-11-09 09:53:45,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:53:45,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:53:45,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:53:45,572 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:53:45,572 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:53:45,573 INFO L791 eck$LassoCheckResult]: Stem: 17894#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 17895#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 17906#L536 assume !(main_~length~0 < 1); 17896#L536-2 assume !(main_~n~1 < 1); 17897#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 17890#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 17891#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 17892#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 17893#L545-4 main_~i~1 := 0; 17900#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17901#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17902#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17903#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17909#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17993#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17992#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17991#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17990#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17989#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17988#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17987#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17986#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17985#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17984#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17983#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17982#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17981#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17980#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17979#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17978#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17977#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17976#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17975#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17974#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17973#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17972#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17971#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17970#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17969#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17968#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17967#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17966#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17965#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17964#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17963#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17962#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17961#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17960#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17959#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17958#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17957#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17956#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17955#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17954#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17953#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17952#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17951#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17950#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17949#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17948#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17947#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17946#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17945#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17944#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17943#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17942#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17941#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17940#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17939#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17938#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17937#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17936#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17935#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17934#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17933#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17932#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17931#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17930#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17929#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17928#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17927#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17926#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17925#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17924#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17923#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17922#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17921#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17920#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17919#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17918#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17917#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17916#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17915#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17914#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17913#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17912#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 17911#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 17910#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 17898#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 17899#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 17908#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 17907#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 17904#L528-2 [2021-11-09 09:53:45,573 INFO L793 eck$LassoCheckResult]: Loop: 17904#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 17905#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 17904#L528-2 [2021-11-09 09:53:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:53:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash -139953673, now seen corresponding path program 44 times [2021-11-09 09:53:45,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:53:45,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430421728] [2021-11-09 09:53:45,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:53:45,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:53:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:53:46,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:53:46,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430421728] [2021-11-09 09:53:46,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430421728] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:53:46,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946084153] [2021-11-09 09:53:46,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-09 09:53:46,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:53:46,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:53:46,972 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:53:46,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2021-11-09 09:53:48,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-09 09:53:48,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-09 09:53:48,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-09 09:53:48,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:53:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:53:52,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946084153] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:53:52,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:53:52,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2021-11-09 09:53:52,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723180889] [2021-11-09 09:53:52,068 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:53:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:53:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash 3526, now seen corresponding path program 46 times [2021-11-09 09:53:52,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:53:52,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128550053] [2021-11-09 09:53:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:53:52,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:53:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:53:52,084 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:53:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:53:52,086 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:53:52,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:53:52,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-11-09 09:53:52,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1237, Invalid=8269, Unknown=0, NotChecked=0, Total=9506 [2021-11-09 09:53:52,126 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. cyclomatic complexity: 7 Second operand has 98 states, 98 states have (on average 2.0306122448979593) internal successors, (199), 98 states have internal predecessors, (199), 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-09 09:53:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:53:56,090 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2021-11-09 09:53:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-09 09:53:56,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 113 transitions. [2021-11-09 09:53:56,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:53:56,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 107 states and 111 transitions. [2021-11-09 09:53:56,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-09 09:53:56,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-09 09:53:56,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 111 transitions. [2021-11-09 09:53:56,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:53:56,093 INFO L681 BuchiCegarLoop]: Abstraction has 107 states and 111 transitions. [2021-11-09 09:53:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 111 transitions. [2021-11-09 09:53:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2021-11-09 09:53:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 105 states have internal predecessors, (110), 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-09 09:53:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2021-11-09 09:53:56,096 INFO L704 BuchiCegarLoop]: Abstraction has 106 states and 110 transitions. [2021-11-09 09:53:56,096 INFO L587 BuchiCegarLoop]: Abstraction has 106 states and 110 transitions. [2021-11-09 09:53:56,096 INFO L425 BuchiCegarLoop]: ======== Iteration 52============ [2021-11-09 09:53:56,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 110 transitions. [2021-11-09 09:53:56,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-09 09:53:56,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:53:56,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:53:56,097 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:53:56,097 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-09 09:53:56,097 INFO L791 eck$LassoCheckResult]: Stem: 18605#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 18606#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 18617#L536 assume !(main_~length~0 < 1); 18607#L536-2 assume !(main_~n~1 < 1); 18608#L539-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 18601#L545-3 assume !!(main_~i~0 < main_~length~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 18602#L545-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 18603#L545-3 assume !(main_~i~0 < main_~length~0 - 1); 18604#L545-4 main_~i~1 := 0; 18611#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18612#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18613#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18614#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18620#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18706#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18705#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18704#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18703#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18702#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18701#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18700#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18699#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18698#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18697#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18696#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18695#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18694#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18693#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18692#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18691#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18690#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18689#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18688#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18687#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18686#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18685#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18684#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18683#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18682#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18681#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18680#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18679#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18678#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18677#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18676#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18675#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18674#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18673#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18672#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18671#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18670#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18669#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18668#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18667#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18666#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18665#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18664#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18663#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18662#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18661#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18660#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18659#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18658#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18657#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18656#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18655#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18654#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18653#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18652#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18651#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18650#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18649#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18648#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18647#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18646#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18645#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18644#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18643#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18642#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18641#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18640#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18639#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18638#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18637#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18636#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18635#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18634#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18633#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18632#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18631#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18630#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18629#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18628#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18627#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18626#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18625#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18624#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18623#L550-3 assume !!(main_~i~1 < main_~n~1 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 18622#L550-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 18621#L550-3 assume !(main_~i~1 < main_~n~1 - 1); 18609#L550-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 18610#L519 assume !(0 != cstrlcpy_~n~0 % 4294967296); 18619#L519-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 18618#L526 assume !(0 != cstrlcpy_~siz % 4294967296); 18615#L528-2 [2021-11-09 09:53:56,097 INFO L793 eck$LassoCheckResult]: Loop: 18615#L528-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 18616#L528 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 18615#L528-2 [2021-11-09 09:53:56,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:53:56,097 INFO L85 PathProgramCache]: Analyzing trace with hash 279557269, now seen corresponding path program 45 times [2021-11-09 09:53:56,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:53:56,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102692635] [2021-11-09 09:53:56,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:53:56,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:53:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2026 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-09 09:53:57,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:53:57,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102692635] [2021-11-09 09:53:57,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102692635] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:53:57,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457579415] [2021-11-09 09:53:57,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-09 09:53:57,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:53:57,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:53:57,540 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:53:57,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b924b93-2e95-43d9-ae48-d44d25332988/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process