./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -s /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer --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 860b8b475b7671f4fb04d10fe02f66a14a39a96b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:07:44,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:44,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:44,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:44,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:44,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:44,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:44,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:44,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:44,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:44,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:44,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:44,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:44,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:44,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:44,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:44,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:44,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:44,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:44,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:44,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:44,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:44,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:44,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:44,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:44,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:44,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:44,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:44,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:44,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:44,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:44,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:44,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:44,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:44,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:44,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:44,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:44,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:44,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:44,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:44,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:44,921 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 10:07:44,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:44,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:44,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:44,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:44,933 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:44,933 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 10:07:44,933 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 10:07:44,933 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 10:07:44,933 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 10:07:44,933 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 10:07:44,933 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 10:07:44,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:44,934 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:44,934 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:07:44,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:44,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:44,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:44,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 10:07:44,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 10:07:44,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 10:07:44,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:44,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:44,935 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 10:07:44,935 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:44,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 10:07:44,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:44,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:44,935 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 10:07:44,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:44,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:44,936 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:44,936 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 10:07:44,937 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 10:07:44,937 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer 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 -> 860b8b475b7671f4fb04d10fe02f66a14a39a96b [2019-12-07 10:07:45,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:45,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:45,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:45,046 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:45,046 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:45,046 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2019-12-07 10:07:45,083 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/data/662b78f73/17b7cf660d96463683614026511cae4e/FLAGced499b8e [2019-12-07 10:07:45,434 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:45,435 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2019-12-07 10:07:45,438 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/data/662b78f73/17b7cf660d96463683614026511cae4e/FLAGced499b8e [2019-12-07 10:07:45,447 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/data/662b78f73/17b7cf660d96463683614026511cae4e [2019-12-07 10:07:45,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:45,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:45,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:45,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:45,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:45,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:45" (1/1) ... [2019-12-07 10:07:45,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41225bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45, skipping insertion in model container [2019-12-07 10:07:45,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:45" (1/1) ... [2019-12-07 10:07:45,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:45,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:45,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:45,613 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:45,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:45,645 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:45,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45 WrapperNode [2019-12-07 10:07:45,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:45,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:45,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:45,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:45,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45" (1/1) ... [2019-12-07 10:07:45,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45" (1/1) ... [2019-12-07 10:07:45,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:45,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:45,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:45,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:45,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45" (1/1) ... [2019-12-07 10:07:45,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45" (1/1) ... [2019-12-07 10:07:45,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45" (1/1) ... [2019-12-07 10:07:45,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45" (1/1) ... [2019-12-07 10:07:45,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45" (1/1) ... [2019-12-07 10:07:45,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45" (1/1) ... [2019-12-07 10:07:45,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45" (1/1) ... [2019-12-07 10:07:45,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:45,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:45,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:45,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:45,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:45,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:07:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:45,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:07:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:07:45,855 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:45,856 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:07:45,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:45 BoogieIcfgContainer [2019-12-07 10:07:45,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:45,857 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 10:07:45,857 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 10:07:45,859 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 10:07:45,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 10:07:45,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 10:07:45" (1/3) ... [2019-12-07 10:07:45,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56357c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 10:07:45, skipping insertion in model container [2019-12-07 10:07:45,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 10:07:45,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:45" (2/3) ... [2019-12-07 10:07:45,861 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56357c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 10:07:45, skipping insertion in model container [2019-12-07 10:07:45,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 10:07:45,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:45" (3/3) ... [2019-12-07 10:07:45,862 INFO L371 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2019-12-07 10:07:45,890 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 10:07:45,890 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 10:07:45,890 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 10:07:45,890 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:45,890 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:45,890 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 10:07:45,890 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:45,890 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 10:07:45,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-12-07 10:07:45,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-12-07 10:07:45,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:45,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:45,916 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 10:07:45,916 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:07:45,916 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 10:07:45,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-12-07 10:07:45,917 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-12-07 10:07:45,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:45,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:45,918 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 10:07:45,918 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 10:07:45,923 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 4#L19-3true [2019-12-07 10:07:45,923 INFO L796 eck$LassoCheckResult]: Loop: 4#L19-3true assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 6#L19-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 4#L19-3true [2019-12-07 10:07:45,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:45,927 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-12-07 10:07:45,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:45,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429745528] [2019-12-07 10:07:45,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,010 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:46,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-12-07 10:07:46,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441958529] [2019-12-07 10:07:46,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,023 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:46,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,025 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-12-07 10:07:46,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920020616] [2019-12-07 10:07:46,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,046 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:46,155 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 10:07:46,155 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 10:07:46,155 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 10:07:46,155 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 10:07:46,155 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 10:07:46,156 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:46,156 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 10:07:46,156 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 10:07:46,156 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2019-12-07 10:07:46,156 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 10:07:46,156 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 10:07:46,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:46,323 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 10:07:46,326 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:46,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:46,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:46,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:46,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:46,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:46,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:46,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:46,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:46,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:46,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:46,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:46,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:46,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:46,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:46,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:46,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:46,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:46,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:46,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:46,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:46,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:46,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:46,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:46,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:46,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:46,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:46,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:46,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:46,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:46,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:46,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:46,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:46,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:46,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:46,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:46,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:46,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:46,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:46,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:46,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:46,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:46,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:46,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:46,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:46,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:46,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:46,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:46,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:46,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:46,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:46,400 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 10:07:46,421 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-12-07 10:07:46,421 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:46,424 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 10:07:46,427 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 10:07:46,427 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 10:07:46,428 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1) = -2*ULTIMATE.start_main_~i~0 + 21*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_1 Supporting invariants [] [2019-12-07 10:07:46,434 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-12-07 10:07:46,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 10:07:46,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:46,468 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:46,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:46,481 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:07:46,481 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:46,513 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 [2019-12-07 10:07:46,514 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-12-07 10:07:46,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 25 states and 35 transitions. Complement of second has 8 states. [2019-12-07 10:07:46,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 10:07:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 10:07:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-12-07 10:07:46,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2019-12-07 10:07:46,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:46,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2019-12-07 10:07:46,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:46,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2019-12-07 10:07:46,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:46,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2019-12-07 10:07:46,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:46,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 7 states and 9 transitions. [2019-12-07 10:07:46,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-12-07 10:07:46,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-12-07 10:07:46,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-12-07 10:07:46,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:46,571 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-12-07 10:07:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-12-07 10:07:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-12-07 10:07:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-12-07 10:07:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-12-07 10:07:46,596 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-12-07 10:07:46,596 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-12-07 10:07:46,596 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 10:07:46,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-12-07 10:07:46,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:46,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:46,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:46,597 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 10:07:46,597 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 10:07:46,598 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 84#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 85#L19-3 assume !(main_~i~0 < 11); 82#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 83#L26-2 [2019-12-07 10:07:46,598 INFO L796 eck$LassoCheckResult]: Loop: 83#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 83#L26-2 [2019-12-07 10:07:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,598 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-12-07 10:07:46,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030237586] [2019-12-07 10:07:46,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:46,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030237586] [2019-12-07 10:07:46,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:46,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:46,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54864569] [2019-12-07 10:07:46,632 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:46,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,633 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2019-12-07 10:07:46,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477725775] [2019-12-07 10:07:46,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,654 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:46,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:46,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:46,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:46,708 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-12-07 10:07:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:46,723 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-12-07 10:07:46,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:46,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-12-07 10:07:46,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:46,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-12-07 10:07:46,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-12-07 10:07:46,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-12-07 10:07:46,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-12-07 10:07:46,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:46,725 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-12-07 10:07:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-12-07 10:07:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-12-07 10:07:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-12-07 10:07:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-12-07 10:07:46,726 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-12-07 10:07:46,726 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-12-07 10:07:46,726 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 10:07:46,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-12-07 10:07:46,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:46,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:46,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:46,727 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 10:07:46,727 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 10:07:46,728 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 104#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 105#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 108#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 109#L19-3 assume !(main_~i~0 < 11); 106#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 107#L26-2 [2019-12-07 10:07:46,728 INFO L796 eck$LassoCheckResult]: Loop: 107#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 107#L26-2 [2019-12-07 10:07:46,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,728 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-12-07 10:07:46,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691887622] [2019-12-07 10:07:46,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:46,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691887622] [2019-12-07 10:07:46,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049359751] [2019-12-07 10:07:46,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:46,771 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:07:46,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:46,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:46,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-07 10:07:46,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752379580] [2019-12-07 10:07:46,777 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:46,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,777 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2019-12-07 10:07:46,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640606150] [2019-12-07 10:07:46,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,791 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:46,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:46,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:46,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:46,835 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-12-07 10:07:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:46,851 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-12-07 10:07:46,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:46,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-12-07 10:07:46,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:46,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-12-07 10:07:46,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-12-07 10:07:46,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-12-07 10:07:46,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-12-07 10:07:46,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:46,852 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-12-07 10:07:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-12-07 10:07:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-12-07 10:07:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 10:07:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-12-07 10:07:46,854 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-12-07 10:07:46,854 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-12-07 10:07:46,854 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 10:07:46,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-12-07 10:07:46,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:46,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:46,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:46,855 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-12-07 10:07:46,855 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 10:07:46,855 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 145#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 146#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 150#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 151#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 152#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 153#L19-3 assume !(main_~i~0 < 11); 147#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 148#L26-2 [2019-12-07 10:07:46,855 INFO L796 eck$LassoCheckResult]: Loop: 148#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 148#L26-2 [2019-12-07 10:07:46,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,855 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-12-07 10:07:46,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697403078] [2019-12-07 10:07:46,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:46,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697403078] [2019-12-07 10:07:46,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795306859] [2019-12-07 10:07:46,880 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:46,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:07:46,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:46,906 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:07:46,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:46,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:46,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-07 10:07:46,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879562561] [2019-12-07 10:07:46,914 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2019-12-07 10:07:46,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454173570] [2019-12-07 10:07:46,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:46,931 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:46,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:46,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:07:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:07:46,971 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-12-07 10:07:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:46,989 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-12-07 10:07:46,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:46,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-12-07 10:07:46,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:46,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-12-07 10:07:46,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-12-07 10:07:46,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-12-07 10:07:46,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-12-07 10:07:46,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:46,991 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-12-07 10:07:46,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-12-07 10:07:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-12-07 10:07:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-12-07 10:07:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-12-07 10:07:46,992 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-12-07 10:07:46,992 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-12-07 10:07:46,992 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 10:07:46,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-12-07 10:07:46,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:46,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:46,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:46,993 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-12-07 10:07:46,993 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 10:07:46,994 INFO L794 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 199#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 200#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 201#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 207#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 205#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 202#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 203#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 206#L19-3 assume !(main_~i~0 < 11); 197#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 198#L26-2 [2019-12-07 10:07:46,994 INFO L796 eck$LassoCheckResult]: Loop: 198#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 198#L26-2 [2019-12-07 10:07:46,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:46,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-12-07 10:07:46,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:46,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901352764] [2019-12-07 10:07:46,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,025 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:47,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901352764] [2019-12-07 10:07:47,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281897369] [2019-12-07 10:07:47,026 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:47,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 10:07:47,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:47,058 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:07:47,059 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:47,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:47,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-07 10:07:47,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452481613] [2019-12-07 10:07:47,066 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:47,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,066 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2019-12-07 10:07:47,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013587860] [2019-12-07 10:07:47,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:47,077 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:47,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:47,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:07:47,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:07:47,118 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-12-07 10:07:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:47,138 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-12-07 10:07:47,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:07:47,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2019-12-07 10:07:47,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:47,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2019-12-07 10:07:47,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-12-07 10:07:47,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-12-07 10:07:47,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2019-12-07 10:07:47,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:47,140 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-12-07 10:07:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2019-12-07 10:07:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-12-07 10:07:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 10:07:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-12-07 10:07:47,141 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-12-07 10:07:47,141 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-12-07 10:07:47,141 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 10:07:47,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-12-07 10:07:47,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:47,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:47,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:47,142 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-12-07 10:07:47,142 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 10:07:47,142 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 262#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 263#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 265#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 266#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 267#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 268#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 272#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 271#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 270#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 269#L19-3 assume !(main_~i~0 < 11); 260#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 261#L26-2 [2019-12-07 10:07:47,142 INFO L796 eck$LassoCheckResult]: Loop: 261#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 261#L26-2 [2019-12-07 10:07:47,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,143 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-12-07 10:07:47,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854239667] [2019-12-07 10:07:47,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:47,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854239667] [2019-12-07 10:07:47,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748574005] [2019-12-07 10:07:47,185 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:47,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:07:47,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:47,213 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:07:47,213 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:47,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:47,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-07 10:07:47,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664931078] [2019-12-07 10:07:47,221 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2019-12-07 10:07:47,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883704699] [2019-12-07 10:07:47,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:47,231 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:47,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:47,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:07:47,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:47,294 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 8 states. [2019-12-07 10:07:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:47,318 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-12-07 10:07:47,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:07:47,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-12-07 10:07:47,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:47,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 10:07:47,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-12-07 10:07:47,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-12-07 10:07:47,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-12-07 10:07:47,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:47,321 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 10:07:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-12-07 10:07:47,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-12-07 10:07:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 10:07:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-12-07 10:07:47,322 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-12-07 10:07:47,322 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-12-07 10:07:47,322 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 10:07:47,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-12-07 10:07:47,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:47,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:47,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:47,323 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-12-07 10:07:47,323 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 10:07:47,323 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 336#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 337#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 338#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 339#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 340#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 342#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 348#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 347#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 346#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 345#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 344#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 343#L19-3 assume !(main_~i~0 < 11); 334#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 335#L26-2 [2019-12-07 10:07:47,324 INFO L796 eck$LassoCheckResult]: Loop: 335#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 335#L26-2 [2019-12-07 10:07:47,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-12-07 10:07:47,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116852017] [2019-12-07 10:07:47,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:47,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116852017] [2019-12-07 10:07:47,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098876387] [2019-12-07 10:07:47,364 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:47,392 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-12-07 10:07:47,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:47,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 10:07:47,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:47,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:47,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-07 10:07:47,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280679315] [2019-12-07 10:07:47,401 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2019-12-07 10:07:47,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529783430] [2019-12-07 10:07:47,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:47,411 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:47,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:47,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:07:47,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:07:47,453 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 9 states. [2019-12-07 10:07:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:47,478 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-12-07 10:07:47,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:07:47,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2019-12-07 10:07:47,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:47,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2019-12-07 10:07:47,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-12-07 10:07:47,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-12-07 10:07:47,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2019-12-07 10:07:47,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:47,480 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-12-07 10:07:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2019-12-07 10:07:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-12-07 10:07:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 10:07:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-12-07 10:07:47,481 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 10:07:47,481 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-12-07 10:07:47,481 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 10:07:47,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-12-07 10:07:47,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:47,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:47,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:47,482 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2019-12-07 10:07:47,482 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 10:07:47,482 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 419#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 420#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 424#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 425#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 426#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 435#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 434#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 433#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 432#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 431#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 430#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 429#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 428#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 427#L19-3 assume !(main_~i~0 < 11); 421#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 422#L26-2 [2019-12-07 10:07:47,482 INFO L796 eck$LassoCheckResult]: Loop: 422#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 422#L26-2 [2019-12-07 10:07:47,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2019-12-07 10:07:47,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865132126] [2019-12-07 10:07:47,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:47,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865132126] [2019-12-07 10:07:47,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765889883] [2019-12-07 10:07:47,523 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:47,566 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-07 10:07:47,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:47,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:07:47,568 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:47,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:47,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-07 10:07:47,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298753188] [2019-12-07 10:07:47,581 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:47,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,581 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2019-12-07 10:07:47,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130261539] [2019-12-07 10:07:47,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:47,592 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:47,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:47,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:07:47,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:07:47,634 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2019-12-07 10:07:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:47,665 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-12-07 10:07:47,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:07:47,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-12-07 10:07:47,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:47,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2019-12-07 10:07:47,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-12-07 10:07:47,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-12-07 10:07:47,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2019-12-07 10:07:47,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:47,667 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-12-07 10:07:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2019-12-07 10:07:47,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-12-07 10:07:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 10:07:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-12-07 10:07:47,669 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-12-07 10:07:47,669 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-12-07 10:07:47,669 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 10:07:47,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2019-12-07 10:07:47,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:47,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:47,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:47,670 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2019-12-07 10:07:47,670 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 10:07:47,670 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 515#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 516#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 520#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 521#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 522#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 533#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 532#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 531#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 530#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 529#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 528#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 527#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 526#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 525#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 524#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 523#L19-3 assume !(main_~i~0 < 11); 517#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 518#L26-2 [2019-12-07 10:07:47,670 INFO L796 eck$LassoCheckResult]: Loop: 518#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 518#L26-2 [2019-12-07 10:07:47,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,671 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2019-12-07 10:07:47,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043878389] [2019-12-07 10:07:47,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:47,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043878389] [2019-12-07 10:07:47,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028673706] [2019-12-07 10:07:47,722 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,748 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 10:07:47,749 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:47,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:47,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-07 10:07:47,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443039294] [2019-12-07 10:07:47,756 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2019-12-07 10:07:47,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541310158] [2019-12-07 10:07:47,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:47,765 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:47,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:47,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:07:47,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:07:47,799 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 11 states. [2019-12-07 10:07:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:47,822 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-12-07 10:07:47,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:07:47,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2019-12-07 10:07:47,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:47,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 10:07:47,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-12-07 10:07:47,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-12-07 10:07:47,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2019-12-07 10:07:47,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:47,824 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 10:07:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2019-12-07 10:07:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-12-07 10:07:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 10:07:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-12-07 10:07:47,826 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-12-07 10:07:47,826 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-12-07 10:07:47,826 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 10:07:47,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-12-07 10:07:47,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:47,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:47,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:47,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2019-12-07 10:07:47,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 10:07:47,828 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 624#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 625#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 626#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 627#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 628#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 630#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 642#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 641#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 640#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 639#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 638#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 637#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 636#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 635#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 634#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 633#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 632#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 631#L19-3 assume !(main_~i~0 < 11); 622#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 623#L26-2 [2019-12-07 10:07:47,828 INFO L796 eck$LassoCheckResult]: Loop: 623#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 623#L26-2 [2019-12-07 10:07:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2019-12-07 10:07:47,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517529429] [2019-12-07 10:07:47,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:47,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517529429] [2019-12-07 10:07:47,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697928553] [2019-12-07 10:07:47,892 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:47,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:07:47,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:47,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:07:47,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:47,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:47,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-07 10:07:47,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796780267] [2019-12-07 10:07:47,933 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:47,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,934 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2019-12-07 10:07:47,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094515030] [2019-12-07 10:07:47,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:47,943 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:47,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:47,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:07:47,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:07:47,982 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 12 states. [2019-12-07 10:07:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:48,017 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-12-07 10:07:48,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:07:48,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2019-12-07 10:07:48,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:48,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2019-12-07 10:07:48,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-12-07 10:07:48,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-12-07 10:07:48,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2019-12-07 10:07:48,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:48,019 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-12-07 10:07:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2019-12-07 10:07:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-12-07 10:07:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 10:07:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 10:07:48,020 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 10:07:48,020 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 10:07:48,020 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 10:07:48,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2019-12-07 10:07:48,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:48,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:48,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:48,021 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2019-12-07 10:07:48,021 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 10:07:48,022 INFO L794 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 740#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 741#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 745#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 746#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 747#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 762#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 761#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 760#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 759#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 758#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 757#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 756#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 755#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 754#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 753#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 752#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 751#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 750#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 749#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 748#L19-3 assume !(main_~i~0 < 11); 742#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 743#L26-2 [2019-12-07 10:07:48,022 INFO L796 eck$LassoCheckResult]: Loop: 743#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 743#L26-2 [2019-12-07 10:07:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:48,022 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2019-12-07 10:07:48,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:48,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066265491] [2019-12-07 10:07:48,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:48,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066265491] [2019-12-07 10:07:48,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885292979] [2019-12-07 10:07:48,087 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:48,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-12-07 10:07:48,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:48,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 10:07:48,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:48,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:48,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-07 10:07:48,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060865048] [2019-12-07 10:07:48,158 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:48,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:48,158 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2019-12-07 10:07:48,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:48,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010237624] [2019-12-07 10:07:48,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:48,164 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:48,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:48,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:07:48,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:07:48,207 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2019-12-07 10:07:48,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:48,241 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-12-07 10:07:48,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:07:48,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-12-07 10:07:48,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:48,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2019-12-07 10:07:48,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-12-07 10:07:48,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 10:07:48,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2019-12-07 10:07:48,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:48,243 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-12-07 10:07:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2019-12-07 10:07:48,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-12-07 10:07:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 10:07:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-12-07 10:07:48,244 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-12-07 10:07:48,244 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-12-07 10:07:48,244 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 10:07:48,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2019-12-07 10:07:48,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:48,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:48,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:48,245 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2019-12-07 10:07:48,245 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 10:07:48,245 INFO L794 eck$LassoCheckResult]: Stem: 874#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 870#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 871#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 875#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 876#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 877#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 894#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 893#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 892#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 891#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 890#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 889#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 888#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 887#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 886#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 885#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 884#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 883#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 882#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 881#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 880#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 879#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 878#L19-3 assume !(main_~i~0 < 11); 872#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 873#L26-2 [2019-12-07 10:07:48,245 INFO L796 eck$LassoCheckResult]: Loop: 873#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 873#L26-2 [2019-12-07 10:07:48,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:48,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2019-12-07 10:07:48,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:48,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066078023] [2019-12-07 10:07:48,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:48,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066078023] [2019-12-07 10:07:48,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410959290] [2019-12-07 10:07:48,321 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:07:48,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 10:07:48,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:07:48,349 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 10:07:48,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:48,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:07:48,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-07 10:07:48,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962852251] [2019-12-07 10:07:48,359 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 10:07:48,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:48,359 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2019-12-07 10:07:48,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:48,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810187868] [2019-12-07 10:07:48,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:48,367 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:48,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:48,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:07:48,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:07:48,403 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 14 states. [2019-12-07 10:07:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:48,445 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-12-07 10:07:48,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:07:48,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2019-12-07 10:07:48,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:48,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2019-12-07 10:07:48,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-12-07 10:07:48,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-12-07 10:07:48,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2019-12-07 10:07:48,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:48,446 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-12-07 10:07:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2019-12-07 10:07:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-12-07 10:07:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 10:07:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-12-07 10:07:48,448 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-12-07 10:07:48,448 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-12-07 10:07:48,448 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-12-07 10:07:48,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2019-12-07 10:07:48,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-12-07 10:07:48,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 10:07:48,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 10:07:48,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2019-12-07 10:07:48,449 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-12-07 10:07:48,450 INFO L794 eck$LassoCheckResult]: Stem: 1014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1010#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 1011#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1015#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1016#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1017#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1036#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1035#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1034#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1033#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1032#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1031#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1030#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1029#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1028#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1027#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1026#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1025#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1024#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1023#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1022#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1021#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1020#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1019#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1018#L19-3 assume !(main_~i~0 < 11); 1012#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1013#L26-2 [2019-12-07 10:07:48,450 INFO L796 eck$LassoCheckResult]: Loop: 1013#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1013#L26-2 [2019-12-07 10:07:48,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:48,450 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2019-12-07 10:07:48,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:48,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801200835] [2019-12-07 10:07:48,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:48,474 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:48,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2019-12-07 10:07:48,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:48,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094607123] [2019-12-07 10:07:48,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:48,479 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:48,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2019-12-07 10:07:48,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:48,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796235869] [2019-12-07 10:07:48,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:48,508 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:57,148 WARN L192 SmtUtils]: Spent 8.59 s on a formula simplification. DAG size of input: 217 DAG size of output: 163 [2019-12-07 10:07:57,363 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-07 10:07:57,365 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 10:07:57,365 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 10:07:57,365 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 10:07:57,365 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 10:07:57,365 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 10:07:57,365 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:57,365 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 10:07:57,365 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 10:07:57,365 INFO L133 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration13_Lasso [2019-12-07 10:07:57,365 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 10:07:57,366 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 10:07:57,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:57,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:57,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:57,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:57,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:57,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:57,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:57,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:57,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 10:07:57,682 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-12-07 10:07:57,691 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 10:07:57,691 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:57,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:57,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:57,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:57,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:57,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:57,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:57,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:57,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:57,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:57,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:57,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:57,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:57,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:57,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:57,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:57,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:57,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:57,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:57,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:57,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:57,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:57,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:57,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:57,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:57,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:57,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:57,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:57,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:57,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:57,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:57,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:57,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:57,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:57,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:57,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:57,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:57,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:57,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 10:07:57,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:57,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:57,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:57,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 10:07:57,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 10:07:57,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:57,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:57,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:57,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:57,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:57,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:57,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:57,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:57,735 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:57,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:57,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:57,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:57,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:57,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:57,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:57,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:57,745 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:57,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 10:07:57,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 10:07:57,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 10:07:57,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 10:07:57,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 10:07:57,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 10:07:57,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 10:07:57,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 10:07:57,774 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-12-07 10:07:57,774 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99fb589a-d33f-4ae4-92f0-a47ff4605b2c/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 10:07:57,783 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 10:07:57,785 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 10:07:57,785 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 10:07:57,786 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#in~0.offset, ULTIMATE.start_main_~idx_in~0, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2) = -1*ULTIMATE.start_main_~#in~0.offset - 1*ULTIMATE.start_main_~idx_in~0 + 1*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2 Supporting invariants [] [2019-12-07 10:07:57,791 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-12-07 10:07:57,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 10:07:57,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:57,814 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:07:57,816 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:57,821 INFO L264 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:07:57,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:57,822 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-12-07 10:07:57,822 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 2 states. [2019-12-07 10:07:57,825 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3. Second operand 2 states. Result 28 states and 29 transitions. Complement of second has 2 states. [2019-12-07 10:07:57,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-12-07 10:07:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-12-07 10:07:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2019-12-07 10:07:57,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2019-12-07 10:07:57,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:57,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2019-12-07 10:07:57,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:57,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2019-12-07 10:07:57,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 10:07:57,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-12-07 10:07:57,829 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 10:07:57,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2019-12-07 10:07:57,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 10:07:57,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 10:07:57,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 10:07:57,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 10:07:57,829 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:07:57,829 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:07:57,829 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:07:57,830 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-12-07 10:07:57,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:07:57,830 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 10:07:57,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 10:07:57,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 10:07:57 BoogieIcfgContainer [2019-12-07 10:07:57,835 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 10:07:57,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:07:57,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:07:57,836 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:07:57,836 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:45" (3/4) ... [2019-12-07 10:07:57,839 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 10:07:57,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:07:57,840 INFO L168 Benchmark]: Toolchain (without parser) took 12390.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 942.5 MB in the beginning and 893.3 MB in the end (delta: 49.2 MB). Peak memory consumption was 193.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:57,841 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:57,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:57,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:57,842 INFO L168 Benchmark]: Boogie Preprocessor took 15.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:57,842 INFO L168 Benchmark]: RCFGBuilder took 171.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:57,843 INFO L168 Benchmark]: BuchiAutomizer took 11978.35 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 893.3 MB in the end (delta: 175.6 MB). Peak memory consumption was 223.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:57,843 INFO L168 Benchmark]: Witness Printer took 3.68 ms. Allocated memory is still 1.2 GB. Free memory is still 893.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:57,845 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 195.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -148.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 171.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11978.35 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 893.3 MB in the end (delta: 175.6 MB). Peak memory consumption was 223.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.68 ms. Allocated memory is still 1.2 GB. Free memory is still 893.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 21 * unknown-#length-unknown[in] and consists of 5 locations. One deterministic module has affine ranking function -1 * in + -1 * idx_in + unknown-#length-unknown[in] and consists of 2 locations. 11 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.9s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 11.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 52 SDtfs, 73 SDslu, 57 SDs, 0 SdLazy, 299 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax100 hnf100 lsp94 ukn55 mio100 lsp58 div155 bol100 ite103 ukn100 eq156 hnf73 smp97 dnf130 smp98 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...