./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-examples/standard_sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-examples/standard_sentinel-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y --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 590a845a219659d0ad58521e10c3551f2ec7e80ca70e994a8616abe765f6f296 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 18:33:19,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 18:33:19,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 18:33:19,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 18:33:19,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 18:33:19,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 18:33:19,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 18:33:19,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 18:33:19,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 18:33:19,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 18:33:19,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 18:33:19,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 18:33:19,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 18:33:19,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 18:33:19,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 18:33:19,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 18:33:19,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 18:33:19,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 18:33:19,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 18:33:19,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 18:33:19,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 18:33:19,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 18:33:19,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 18:33:19,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 18:33:19,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 18:33:19,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 18:33:19,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 18:33:19,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 18:33:19,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 18:33:19,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 18:33:19,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 18:33:19,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 18:33:19,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 18:33:19,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 18:33:19,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 18:33:19,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 18:33:19,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 18:33:19,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 18:33:19,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 18:33:19,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 18:33:19,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 18:33:19,515 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-13 18:33:19,558 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 18:33:19,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 18:33:19,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 18:33:19,566 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 18:33:19,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 18:33:19,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 18:33:19,568 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 18:33:19,568 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-13 18:33:19,569 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-13 18:33:19,569 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-13 18:33:19,570 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-13 18:33:19,570 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-13 18:33:19,571 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-13 18:33:19,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 18:33:19,571 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 18:33:19,571 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-13 18:33:19,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 18:33:19,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 18:33:19,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 18:33:19,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-13 18:33:19,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-13 18:33:19,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-13 18:33:19,573 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 18:33:19,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 18:33:19,573 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-13 18:33:19,574 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 18:33:19,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-13 18:33:19,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 18:33:19,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 18:33:19,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 18:33:19,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 18:33:19,577 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 18:33:19,578 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-13 18:33:19,578 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_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/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_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y 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 -> 590a845a219659d0ad58521e10c3551f2ec7e80ca70e994a8616abe765f6f296 [2021-11-13 18:33:19,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 18:33:19,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 18:33:19,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 18:33:19,846 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 18:33:19,848 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 18:33:19,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/../../sv-benchmarks/c/array-examples/standard_sentinel-2.i [2021-11-13 18:33:19,908 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/data/95947d303/ff8398db5d76413ab9ecac9ef8e9db01/FLAGf86b0a027 [2021-11-13 18:33:20,362 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 18:33:20,362 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/sv-benchmarks/c/array-examples/standard_sentinel-2.i [2021-11-13 18:33:20,368 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/data/95947d303/ff8398db5d76413ab9ecac9ef8e9db01/FLAGf86b0a027 [2021-11-13 18:33:20,780 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/data/95947d303/ff8398db5d76413ab9ecac9ef8e9db01 [2021-11-13 18:33:20,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 18:33:20,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 18:33:20,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 18:33:20,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 18:33:20,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 18:33:20,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:33:20" (1/1) ... [2021-11-13 18:33:20,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a669856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:20, skipping insertion in model container [2021-11-13 18:33:20,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:33:20" (1/1) ... [2021-11-13 18:33:20,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 18:33:20,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 18:33:20,947 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/sv-benchmarks/c/array-examples/standard_sentinel-2.i[852,865] [2021-11-13 18:33:20,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 18:33:20,968 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 18:33:20,994 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/sv-benchmarks/c/array-examples/standard_sentinel-2.i[852,865] [2021-11-13 18:33:21,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 18:33:21,014 INFO L208 MainTranslator]: Completed translation [2021-11-13 18:33:21,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:21 WrapperNode [2021-11-13 18:33:21,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 18:33:21,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 18:33:21,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 18:33:21,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 18:33:21,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:21" (1/1) ... [2021-11-13 18:33:21,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:21" (1/1) ... [2021-11-13 18:33:21,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 18:33:21,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 18:33:21,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 18:33:21,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 18:33:21,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:21" (1/1) ... [2021-11-13 18:33:21,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:21" (1/1) ... [2021-11-13 18:33:21,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:21" (1/1) ... [2021-11-13 18:33:21,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:21" (1/1) ... [2021-11-13 18:33:21,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:21" (1/1) ... [2021-11-13 18:33:21,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:21" (1/1) ... [2021-11-13 18:33:21,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:21" (1/1) ... [2021-11-13 18:33:21,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 18:33:21,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 18:33:21,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 18:33:21,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 18:33:21,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:21" (1/1) ... [2021-11-13 18:33:21,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:21,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:21,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:33:21,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-13 18:33:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 18:33:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 18:33:21,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-13 18:33:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 18:33:21,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 18:33:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-13 18:33:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 18:33:21,348 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 18:33:21,349 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-13 18:33:21,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:33:21 BoogieIcfgContainer [2021-11-13 18:33:21,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 18:33:21,352 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-13 18:33:21,352 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-13 18:33:21,356 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-13 18:33:21,370 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-13 18:33:21,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 06:33:20" (1/3) ... [2021-11-13 18:33:21,382 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@495ffaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 06:33:21, skipping insertion in model container [2021-11-13 18:33:21,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-13 18:33:21,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:33:21" (2/3) ... [2021-11-13 18:33:21,383 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@495ffaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 06:33:21, skipping insertion in model container [2021-11-13 18:33:21,383 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-13 18:33:21,383 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:33:21" (3/3) ... [2021-11-13 18:33:21,384 INFO L388 chiAutomizerObserver]: Analyzing ICFG standard_sentinel-2.i [2021-11-13 18:33:21,445 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-13 18:33:21,445 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-13 18:33:21,446 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-13 18:33:21,446 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-13 18:33:21,446 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-13 18:33:21,446 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-13 18:33:21,446 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-13 18:33:21,447 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-13 18:33:21,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-13 18:33:21,483 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-13 18:33:21,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:33:21,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:33:21,492 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-13 18:33:21,492 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 18:33:21,492 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-13 18:33:21,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-13 18:33:21,496 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-13 18:33:21,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:33:21,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:33:21,497 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-13 18:33:21,497 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 18:33:21,504 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(22); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_#t~mem7#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~pos~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~i~0#1 := 0; 11#L20-3true [2021-11-13 18:33:21,505 INFO L793 eck$LassoCheckResult]: Loop: 11#L20-3true assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 12#L20-2true main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 11#L20-3true [2021-11-13 18:33:21,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-13 18:33:21,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:21,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467251970] [2021-11-13 18:33:21,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:21,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:21,631 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:33:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:21,679 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:33:21,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:21,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-11-13 18:33:21,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:21,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399660826] [2021-11-13 18:33:21,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:21,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:21,692 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:33:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:21,701 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:33:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-11-13 18:33:21,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:21,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124900491] [2021-11-13 18:33:21,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:21,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:21,743 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:33:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:21,799 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:33:22,244 INFO L210 LassoAnalysis]: Preferences: [2021-11-13 18:33:22,245 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-13 18:33:22,245 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-13 18:33:22,245 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-13 18:33:22,245 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-13 18:33:22,245 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:22,246 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-13 18:33:22,246 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-13 18:33:22,246 INFO L133 ssoRankerPreferences]: Filename of dumped script: standard_sentinel-2.i_Iteration1_Lasso [2021-11-13 18:33:22,246 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-13 18:33:22,246 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-13 18:33:22,267 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-13 18:33:22,273 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-13 18:33:22,275 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-13 18:33:22,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-13 18:33:22,282 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-13 18:33:22,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:33:22,444 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-13 18:33:22,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-13 18:33:22,449 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-13 18:33:22,452 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-13 18:33:22,454 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-13 18:33:22,457 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-13 18:33:22,725 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-13 18:33:22,729 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-13 18:33:22,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:22,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:22,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:33:22,746 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-13 18:33:22,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:33:22,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:33:22,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:33:22,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:33:22,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:33:22,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:33:22,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:33:22,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-13 18:33:22,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:33:22,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-11-13 18:33:22,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:22,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:22,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:33:22,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-13 18:33:22,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-13 18:33:22,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:33:22,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:33:22,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:33:22,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:33:22,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:33:22,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:33:22,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:33:22,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:33:22,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-11-13 18:33:22,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:22,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:22,888 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:33:22,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-13 18:33:22,894 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-13 18:33:22,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:33:22,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:33:22,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:33:22,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:33:22,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:33:22,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:33:22,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:33:22,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-13 18:33:22,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:22,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:22,961 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:33:22,970 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-13 18:33:22,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-13 18:33:22,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:33:22,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:33:22,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:33:22,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:33:22,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:33:22,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:33:22,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:33:22,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:33:23,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-11-13 18:33:23,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:23,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:23,004 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:33:23,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-13 18:33:23,016 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-13 18:33:23,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:33:23,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:33:23,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:33:23,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:33:23,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:33:23,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:33:23,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:33:23,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-11-13 18:33:23,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:23,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:23,099 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:33:23,120 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-13 18:33:23,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-13 18:33:23,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:33:23,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:33:23,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:33:23,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:33:23,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:33:23,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:33:23,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:33:23,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-13 18:33:23,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:23,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:23,190 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:33:23,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-13 18:33:23,197 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-13 18:33:23,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:33:23,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-13 18:33:23,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:33:23,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:33:23,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:33:23,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-13 18:33:23,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-13 18:33:23,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:33:23,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-13 18:33:23,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:23,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:23,240 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:33:23,270 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-13 18:33:23,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:33:23,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:33:23,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:33:23,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:33:23,290 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:33:23,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:33:23,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-13 18:33:23,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:33:23,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-11-13 18:33:23,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:23,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:23,346 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:33:23,351 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-13 18:33:23,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-13 18:33:23,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:33:23,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:33:23,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:33:23,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:33:23,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:33:23,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:33:23,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-13 18:33:23,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-13 18:33:23,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:23,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:23,415 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:33:23,424 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-13 18:33:23,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-13 18:33:23,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-13 18:33:23,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-13 18:33:23,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-13 18:33:23,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-13 18:33:23,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-13 18:33:23,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-11-13 18:33:23,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-13 18:33:23,490 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2021-11-13 18:33:23,490 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-11-13 18:33:23,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-13 18:33:23,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:23,493 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-13 18:33:23,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-11-13 18:33:23,514 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-13 18:33:23,539 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-13 18:33:23,539 INFO L513 LassoAnalysis]: Proved termination. [2021-11-13 18:33:23,539 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-11-13 18:33:23,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-11-13 18:33:23,593 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-11-13 18:33:23,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:33:23,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-13 18:33:23,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:33:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:33:23,653 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-13 18:33:23,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:33:23,719 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-13 18:33:23,757 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-13 18:33:23,765 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-13 18:33:23,830 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 36 states and 50 transitions. Complement of second has 8 states. [2021-11-13 18:33:23,831 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-13 18:33:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-13 18:33:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-11-13 18:33:23,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 2 letters. [2021-11-13 18:33:23,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-13 18:33:23,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2021-11-13 18:33:23,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-13 18:33:23,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 4 letters. [2021-11-13 18:33:23,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-13 18:33:23,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2021-11-13 18:33:23,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:23,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 8 states and 10 transitions. [2021-11-13 18:33:23,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-11-13 18:33:23,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-11-13 18:33:23,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2021-11-13 18:33:23,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:33:23,857 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-11-13 18:33:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2021-11-13 18:33:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-11-13 18:33:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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-13 18:33:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2021-11-13 18:33:23,882 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-11-13 18:33:23,883 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2021-11-13 18:33:23,883 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-13 18:33:23,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2021-11-13 18:33:23,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:23,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:33:23,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:33:23,885 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-11-13 18:33:23,886 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 18:33:23,886 INFO L791 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(22); 120#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_#t~mem7#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~pos~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~i~0#1 := 0; 125#L20-3 assume !(main_~i~0#1 < 100000); 126#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 122#L28-3 [2021-11-13 18:33:23,887 INFO L793 eck$LassoCheckResult]: Loop: 122#L28-3 call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 121#L28-1 assume !!(main_#t~mem7#1 != main_~marker~0#1);havoc main_#t~mem7#1;main_~i~1#1 := 1 + main_~i~1#1; 122#L28-3 [2021-11-13 18:33:23,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash 925709, now seen corresponding path program 1 times [2021-11-13 18:33:23,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:23,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331783836] [2021-11-13 18:33:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:23,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:33:23,980 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-13 18:33:23,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:33:23,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331783836] [2021-11-13 18:33:23,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331783836] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:33:23,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:33:23,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 18:33:23,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095876069] [2021-11-13 18:33:23,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:33:23,984 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 18:33:23,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2021-11-13 18:33:23,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:23,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062399755] [2021-11-13 18:33:23,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:23,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:23,998 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:33:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:24,016 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:33:24,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:33:24,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 18:33:24,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 18:33:24,066 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-13 18:33:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:33:24,080 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2021-11-13 18:33:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 18:33:24,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2021-11-13 18:33:24,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:24,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2021-11-13 18:33:24,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-11-13 18:33:24,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-11-13 18:33:24,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2021-11-13 18:33:24,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:33:24,084 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-11-13 18:33:24,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2021-11-13 18:33:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2021-11-13 18:33:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 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-13 18:33:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-11-13 18:33:24,086 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-11-13 18:33:24,087 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-11-13 18:33:24,087 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-13 18:33:24,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2021-11-13 18:33:24,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:24,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:33:24,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:33:24,088 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-11-13 18:33:24,088 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 18:33:24,088 INFO L791 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(22); 143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_#t~mem7#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~pos~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~i~0#1 := 0; 144#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 145#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 146#L20-3 assume !(main_~i~0#1 < 100000); 147#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 149#L28-3 [2021-11-13 18:33:24,088 INFO L793 eck$LassoCheckResult]: Loop: 149#L28-3 call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 148#L28-1 assume !!(main_#t~mem7#1 != main_~marker~0#1);havoc main_#t~mem7#1;main_~i~1#1 := 1 + main_~i~1#1; 149#L28-3 [2021-11-13 18:33:24,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:24,088 INFO L85 PathProgramCache]: Analyzing trace with hash 889660431, now seen corresponding path program 1 times [2021-11-13 18:33:24,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:24,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813601527] [2021-11-13 18:33:24,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:24,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:33:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:24,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:33:24,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813601527] [2021-11-13 18:33:24,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813601527] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:33:24,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42819995] [2021-11-13 18:33:24,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:24,121 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:33:24,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:24,122 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:33:24,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-13 18:33:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:33:24,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-13 18:33:24,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:33:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:24,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:33:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:24,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42819995] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:33:24,227 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:33:24,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-13 18:33:24,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709818956] [2021-11-13 18:33:24,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:33:24,228 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 18:33:24,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2021-11-13 18:33:24,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:24,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200144980] [2021-11-13 18:33:24,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:24,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:24,237 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:33:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:24,242 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:33:24,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:33:24,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 18:33:24,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-13 18:33:24,276 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 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-13 18:33:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:33:24,296 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2021-11-13 18:33:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 18:33:24,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2021-11-13 18:33:24,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:24,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2021-11-13 18:33:24,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-11-13 18:33:24,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-11-13 18:33:24,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2021-11-13 18:33:24,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:33:24,299 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-13 18:33:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2021-11-13 18:33:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-13 18:33:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 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-13 18:33:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-11-13 18:33:24,301 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-13 18:33:24,301 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-13 18:33:24,301 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-13 18:33:24,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2021-11-13 18:33:24,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:24,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:33:24,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:33:24,303 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2021-11-13 18:33:24,303 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 18:33:24,303 INFO L791 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(22); 205#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_#t~mem7#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~pos~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~i~0#1 := 0; 206#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 207#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 208#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 209#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 210#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 217#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 216#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 215#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 214#L20-3 assume !(main_~i~0#1 < 100000); 213#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 212#L28-3 [2021-11-13 18:33:24,303 INFO L793 eck$LassoCheckResult]: Loop: 212#L28-3 call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 211#L28-1 assume !!(main_#t~mem7#1 != main_~marker~0#1);havoc main_#t~mem7#1;main_~i~1#1 := 1 + main_~i~1#1; 212#L28-3 [2021-11-13 18:33:24,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:24,304 INFO L85 PathProgramCache]: Analyzing trace with hash 833936661, now seen corresponding path program 2 times [2021-11-13 18:33:24,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:24,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287965290] [2021-11-13 18:33:24,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:24,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:33:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:24,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:33:24,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287965290] [2021-11-13 18:33:24,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287965290] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:33:24,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5222600] [2021-11-13 18:33:24,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-13 18:33:24,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:33:24,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:24,366 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:33:24,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-13 18:33:24,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-13 18:33:24,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 18:33:24,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-13 18:33:24,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:33:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:24,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:33:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:24,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5222600] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:33:24,562 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:33:24,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-11-13 18:33:24,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732746153] [2021-11-13 18:33:24,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:33:24,563 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 18:33:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:24,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 3 times [2021-11-13 18:33:24,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:24,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942494385] [2021-11-13 18:33:24,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:24,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:24,568 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:33:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:24,573 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:33:24,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:33:24,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-13 18:33:24,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-13 18:33:24,605 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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-13 18:33:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:33:24,653 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2021-11-13 18:33:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 18:33:24,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2021-11-13 18:33:24,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:24,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2021-11-13 18:33:24,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-11-13 18:33:24,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-11-13 18:33:24,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2021-11-13 18:33:24,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:33:24,673 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-11-13 18:33:24,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2021-11-13 18:33:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-11-13 18:33:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:33:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2021-11-13 18:33:24,676 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-11-13 18:33:24,676 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-11-13 18:33:24,676 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-13 18:33:24,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2021-11-13 18:33:24,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:24,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:33:24,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:33:24,678 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2021-11-13 18:33:24,678 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 18:33:24,678 INFO L791 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(22); 327#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_#t~mem7#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~pos~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~i~0#1 := 0; 328#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 329#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 330#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 331#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 332#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 351#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 350#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 349#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 348#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 347#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 346#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 345#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 344#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 343#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 342#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 341#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 340#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 339#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 338#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 337#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 336#L20-3 assume !(main_~i~0#1 < 100000); 335#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 334#L28-3 [2021-11-13 18:33:24,678 INFO L793 eck$LassoCheckResult]: Loop: 334#L28-3 call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 333#L28-1 assume !!(main_#t~mem7#1 != main_~marker~0#1);havoc main_#t~mem7#1;main_~i~1#1 := 1 + main_~i~1#1; 334#L28-3 [2021-11-13 18:33:24,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:24,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272353, now seen corresponding path program 3 times [2021-11-13 18:33:24,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:24,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071482396] [2021-11-13 18:33:24,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:24,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:33:24,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-11-13 18:33:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:24,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:33:24,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071482396] [2021-11-13 18:33:24,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071482396] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:33:24,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623721044] [2021-11-13 18:33:24,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-13 18:33:24,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:33:24,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:24,862 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:33:24,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-13 18:33:25,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-11-13 18:33:25,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 18:33:25,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-13 18:33:25,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:33:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:25,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:33:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:25,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623721044] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:33:25,345 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:33:25,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2021-11-13 18:33:25,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810349536] [2021-11-13 18:33:25,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:33:25,346 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 18:33:25,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 4 times [2021-11-13 18:33:25,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:25,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449601981] [2021-11-13 18:33:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:25,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:25,351 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:33:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:25,354 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:33:25,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:33:25,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-13 18:33:25,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2021-11-13 18:33:25,389 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 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-13 18:33:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:33:25,500 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2021-11-13 18:33:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-13 18:33:25,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 51 transitions. [2021-11-13 18:33:25,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:25,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 51 transitions. [2021-11-13 18:33:25,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-11-13 18:33:25,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-11-13 18:33:25,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 51 transitions. [2021-11-13 18:33:25,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:33:25,515 INFO L681 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2021-11-13 18:33:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 51 transitions. [2021-11-13 18:33:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-11-13 18:33:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 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-13 18:33:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2021-11-13 18:33:25,522 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2021-11-13 18:33:25,522 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2021-11-13 18:33:25,522 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-13 18:33:25,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2021-11-13 18:33:25,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:25,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:33:25,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:33:25,531 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2021-11-13 18:33:25,531 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 18:33:25,532 INFO L791 eck$LassoCheckResult]: Stem: 568#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(22); 569#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_#t~mem7#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~pos~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~i~0#1 := 0; 570#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 571#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 572#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 573#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 574#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 617#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 616#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 615#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 614#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 613#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 612#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 611#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 610#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 609#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 608#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 607#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 606#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 605#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 604#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 603#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 602#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 601#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 600#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 599#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 598#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 597#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 596#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 595#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 594#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 593#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 592#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 591#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 590#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 589#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 588#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 587#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 586#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 585#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 584#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 583#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 582#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 581#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 580#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 579#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 578#L20-3 assume !(main_~i~0#1 < 100000); 577#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 576#L28-3 [2021-11-13 18:33:25,532 INFO L793 eck$LassoCheckResult]: Loop: 576#L28-3 call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 575#L28-1 assume !!(main_#t~mem7#1 != main_~marker~0#1);havoc main_#t~mem7#1;main_~i~1#1 := 1 + main_~i~1#1; 576#L28-3 [2021-11-13 18:33:25,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash 828161209, now seen corresponding path program 4 times [2021-11-13 18:33:25,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:25,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823315526] [2021-11-13 18:33:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:25,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:33:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:25,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:33:25,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823315526] [2021-11-13 18:33:25,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823315526] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:33:25,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952921485] [2021-11-13 18:33:25,953 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-13 18:33:25,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:33:25,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:25,958 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:33:25,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-13 18:33:26,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-13 18:33:26,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 18:33:26,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-13 18:33:26,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:33:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:26,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:33:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:27,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952921485] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:33:27,017 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:33:27,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2021-11-13 18:33:27,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888862823] [2021-11-13 18:33:27,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:33:27,018 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 18:33:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 5 times [2021-11-13 18:33:27,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:27,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688589661] [2021-11-13 18:33:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:27,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:27,022 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:33:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:27,025 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:33:27,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:33:27,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-11-13 18:33:27,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2021-11-13 18:33:27,067 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 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-13 18:33:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:33:27,272 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2021-11-13 18:33:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-13 18:33:27,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 99 transitions. [2021-11-13 18:33:27,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:27,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 99 transitions. [2021-11-13 18:33:27,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-11-13 18:33:27,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-11-13 18:33:27,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 99 transitions. [2021-11-13 18:33:27,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:33:27,285 INFO L681 BuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2021-11-13 18:33:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 99 transitions. [2021-11-13 18:33:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-11-13 18:33:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 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-13 18:33:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2021-11-13 18:33:27,301 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2021-11-13 18:33:27,301 INFO L587 BuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2021-11-13 18:33:27,301 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-13 18:33:27,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions. [2021-11-13 18:33:27,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:27,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:33:27,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:33:27,309 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2021-11-13 18:33:27,312 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 18:33:27,312 INFO L791 eck$LassoCheckResult]: Stem: 1050#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(22); 1051#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_#t~mem7#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~pos~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~i~0#1 := 0; 1052#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1053#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1054#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1055#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1056#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1147#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1146#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1145#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1144#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1143#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1142#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1141#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1140#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1139#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1138#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1137#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1136#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1135#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1134#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1133#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1132#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1131#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1130#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1129#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1128#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1127#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1126#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1125#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1124#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1123#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1122#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1121#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1120#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1119#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1118#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1117#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1116#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1115#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1114#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1113#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1112#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1111#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1110#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1109#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1108#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1107#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1106#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1105#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1104#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1103#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1102#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1101#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1100#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1099#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1098#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1097#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1096#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1095#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1094#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1093#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1092#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1091#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1090#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1089#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1088#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1087#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1086#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1085#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1084#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1083#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1082#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1081#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1080#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1079#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1078#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1077#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1076#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1075#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1074#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1073#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1072#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1071#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1070#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1069#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1068#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1067#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1066#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1065#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1064#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1063#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1062#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 1061#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1060#L20-3 assume !(main_~i~0#1 < 100000); 1059#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 1058#L28-3 [2021-11-13 18:33:27,317 INFO L793 eck$LassoCheckResult]: Loop: 1058#L28-3 call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 1057#L28-1 assume !!(main_#t~mem7#1 != main_~marker~0#1);havoc main_#t~mem7#1;main_~i~1#1 := 1 + main_~i~1#1; 1058#L28-3 [2021-11-13 18:33:27,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash 830581481, now seen corresponding path program 5 times [2021-11-13 18:33:27,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:27,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510684590] [2021-11-13 18:33:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:27,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:33:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:28,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:33:28,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510684590] [2021-11-13 18:33:28,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510684590] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:33:28,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677907787] [2021-11-13 18:33:28,531 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-13 18:33:28,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:33:28,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:28,540 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:33:28,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-13 18:33:46,760 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2021-11-13 18:33:46,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 18:33:46,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-13 18:33:46,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:33:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:47,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:33:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:50,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677907787] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:33:50,078 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:33:50,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2021-11-13 18:33:50,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267579900] [2021-11-13 18:33:50,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:33:50,080 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-13 18:33:50,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 6 times [2021-11-13 18:33:50,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:50,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758438488] [2021-11-13 18:33:50,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:50,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:50,086 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 18:33:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 18:33:50,089 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-13 18:33:50,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:33:50,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2021-11-13 18:33:50,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2021-11-13 18:33:50,129 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. cyclomatic complexity: 3 Second operand has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 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-13 18:33:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:33:50,509 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2021-11-13 18:33:50,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-11-13 18:33:50,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 195 transitions. [2021-11-13 18:33:50,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:50,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 195 transitions. [2021-11-13 18:33:50,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-11-13 18:33:50,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-11-13 18:33:50,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 195 transitions. [2021-11-13 18:33:50,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:33:50,516 INFO L681 BuchiCegarLoop]: Abstraction has 194 states and 195 transitions. [2021-11-13 18:33:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 195 transitions. [2021-11-13 18:33:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2021-11-13 18:33:50,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 193 states have internal predecessors, (195), 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-13 18:33:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2021-11-13 18:33:50,526 INFO L704 BuchiCegarLoop]: Abstraction has 194 states and 195 transitions. [2021-11-13 18:33:50,526 INFO L587 BuchiCegarLoop]: Abstraction has 194 states and 195 transitions. [2021-11-13 18:33:50,526 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-13 18:33:50,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 195 transitions. [2021-11-13 18:33:50,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-13 18:33:50,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-13 18:33:50,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-13 18:33:50,535 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1] [2021-11-13 18:33:50,535 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-13 18:33:50,536 INFO L791 eck$LassoCheckResult]: Stem: 2012#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(22); 2013#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_~i~0#1, main_#t~mem7#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~pos~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~i~0#1 := 0; 2014#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2015#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2016#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2017#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2018#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2205#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2204#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2203#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2202#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2201#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2200#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2199#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2198#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2197#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2196#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2195#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2194#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2193#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2192#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2191#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2190#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2189#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2188#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2187#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2186#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2185#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2184#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2183#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2182#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2181#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2180#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2179#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2178#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2177#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2176#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2175#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2174#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2173#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2172#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2171#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2170#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2169#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2168#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2167#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2166#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2165#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2164#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2163#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2162#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2161#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2160#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2159#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2158#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2157#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2156#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2155#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2154#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2153#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2152#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2151#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2150#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2149#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2148#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2147#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2146#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2145#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2144#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2143#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2142#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2141#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2140#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2139#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2138#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2137#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2136#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2135#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2134#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2133#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2132#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2131#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2130#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2129#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2128#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2127#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2126#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2125#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2124#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2123#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2122#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2121#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2120#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2119#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2118#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2117#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2116#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2115#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2114#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2113#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2112#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2111#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2110#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2109#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2108#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2107#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2106#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2105#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2104#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2103#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2102#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2101#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2100#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2099#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2098#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2097#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2096#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2095#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2094#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2093#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2092#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2091#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2090#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2089#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2088#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2087#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2086#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2085#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2084#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2083#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2082#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2081#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2080#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2079#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2078#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2077#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2076#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2075#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2074#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2073#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2072#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2071#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2070#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2069#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2068#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2067#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2066#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2065#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2064#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2063#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2062#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2061#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2060#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2059#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2058#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2057#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2056#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2055#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2054#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2053#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2052#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2051#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2050#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2049#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2048#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2047#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2046#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2045#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2044#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2043#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2042#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2041#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2040#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2039#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2038#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2037#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2036#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2035#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2034#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2033#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2032#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2031#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2030#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2029#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2028#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2027#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2026#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2025#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2024#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet6#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet6#1; 2023#L20-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2022#L20-3 assume !(main_~i~0#1 < 100000); 2021#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 2020#L28-3 [2021-11-13 18:33:50,536 INFO L793 eck$LassoCheckResult]: Loop: 2020#L28-3 call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 2019#L28-1 assume !!(main_#t~mem7#1 != main_~marker~0#1);havoc main_#t~mem7#1;main_~i~1#1 := 1 + main_~i~1#1; 2020#L28-3 [2021-11-13 18:33:50,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:33:50,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1165371209, now seen corresponding path program 6 times [2021-11-13 18:33:50,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:33:50,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742267622] [2021-11-13 18:33:50,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:33:50,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:33:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:33:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:33:54,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:33:54,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742267622] [2021-11-13 18:33:54,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742267622] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:33:54,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789787749] [2021-11-13 18:33:54,016 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-13 18:33:54,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:33:54,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:33:54,017 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:33:54,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be4ec85-e0b5-443d-8ca1-d26184bbd995/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process