./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/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_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/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.24-cad4683 [2019-11-15 23:27:38,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:27:38,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:27:38,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:27:38,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:27:38,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:27:38,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:27:38,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:27:38,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:27:38,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:27:38,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:27:38,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:27:38,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:27:38,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:27:38,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:27:38,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:27:38,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:27:38,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:27:38,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:27:38,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:27:38,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:27:38,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:27:38,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:27:38,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:27:38,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:27:38,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:27:38,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:27:38,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:27:38,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:27:38,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:27:38,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:27:38,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:27:38,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:27:38,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:27:38,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:27:38,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:27:38,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:27:38,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:27:38,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:27:38,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:27:38,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:27:38,964 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:27:38,989 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:27:38,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:27:39,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:27:39,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:27:39,000 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:27:39,001 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:27:39,001 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:27:39,001 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:27:39,001 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:27:39,003 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:27:39,003 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:27:39,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:27:39,004 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:27:39,004 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:27:39,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:27:39,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:27:39,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:27:39,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:27:39,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:27:39,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:27:39,006 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:27:39,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:27:39,007 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:27:39,007 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:27:39,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:27:39,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:27:39,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:27:39,008 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:27:39,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:27:39,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:27:39,009 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:27:39,010 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:27:39,012 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_ab6d489b-2929-4544-b301-9d746a146c67/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-11-15 23:27:39,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:27:39,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:27:39,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:27:39,066 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:27:39,067 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:27:39,067 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2019-11-15 23:27:39,123 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/data/0284765eb/5eb075487fa849faba5868d2d354f895/FLAGb94a46ff1 [2019-11-15 23:27:39,513 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:27:39,514 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2019-11-15 23:27:39,519 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/data/0284765eb/5eb075487fa849faba5868d2d354f895/FLAGb94a46ff1 [2019-11-15 23:27:39,529 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/data/0284765eb/5eb075487fa849faba5868d2d354f895 [2019-11-15 23:27:39,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:27:39,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:27:39,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:27:39,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:27:39,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:27:39,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:27:39" (1/1) ... [2019-11-15 23:27:39,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411f8c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39, skipping insertion in model container [2019-11-15 23:27:39,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:27:39" (1/1) ... [2019-11-15 23:27:39,550 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:27:39,564 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:27:39,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:27:39,828 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:27:39,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:27:39,864 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:27:39,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39 WrapperNode [2019-11-15 23:27:39,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:27:39,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:27:39,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:27:39,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:27:39,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39" (1/1) ... [2019-11-15 23:27:39,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39" (1/1) ... [2019-11-15 23:27:39,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:27:39,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:27:39,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:27:39,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:27:39,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39" (1/1) ... [2019-11-15 23:27:39,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39" (1/1) ... [2019-11-15 23:27:39,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39" (1/1) ... [2019-11-15 23:27:39,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39" (1/1) ... [2019-11-15 23:27:39,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39" (1/1) ... [2019-11-15 23:27:39,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39" (1/1) ... [2019-11-15 23:27:39,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39" (1/1) ... [2019-11-15 23:27:39,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:27:39,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:27:39,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:27:39,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:27:39,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/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-11-15 23:27:39,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:27:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:27:39,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:27:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:27:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:27:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:27:40,201 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:27:40,201 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:27:40,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:27:40 BoogieIcfgContainer [2019-11-15 23:27:40,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:27:40,202 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:27:40,202 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:27:40,205 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:27:40,206 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:27:40,206 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:27:39" (1/3) ... [2019-11-15 23:27:40,207 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3865c5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:27:40, skipping insertion in model container [2019-11-15 23:27:40,207 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:27:40,207 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:27:39" (2/3) ... [2019-11-15 23:27:40,208 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3865c5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:27:40, skipping insertion in model container [2019-11-15 23:27:40,208 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:27:40,208 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:27:40" (3/3) ... [2019-11-15 23:27:40,210 INFO L371 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2019-11-15 23:27:40,283 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:27:40,292 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:27:40,292 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:27:40,293 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:27:40,293 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:27:40,293 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:27:40,293 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:27:40,293 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:27:40,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-15 23:27:40,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-15 23:27:40,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:40,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:40,368 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:27:40,368 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:27:40,368 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:27:40,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-15 23:27:40,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-15 23:27:40,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:40,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:40,370 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:27:40,371 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:27:40,377 INFO L791 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:40,378 INFO L793 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-11-15 23:27:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:27:40,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:40,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467696861] [2019-11-15 23:27:40,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:40,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:40,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:40,510 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:40,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:40,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-15 23:27:40,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:40,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165599132] [2019-11-15 23:27:40,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:40,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:40,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:40,529 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:40,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-15 23:27:40,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:40,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964000045] [2019-11-15 23:27:40,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:40,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:40,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:40,590 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:40,742 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:27:40,743 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:27:40,743 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:27:40,743 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:27:40,743 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:27:40,743 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:27:40,743 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:27:40,744 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:27:40,744 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2019-11-15 23:27:40,744 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:27:40,744 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:27:40,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:40,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:40,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:40,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:40,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:40,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:40,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:40,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:40,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:40,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:40,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:40,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:40,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:27:41,017 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:27:41,021 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:27:41,023 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-11-15 23:27:41,025 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:27:41,025 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:27:41,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:27:41,026 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:27:41,026 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:27:41,027 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:27:41,028 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:27:41,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:27:41,030 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-11-15 23:27:41,030 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:27:41,030 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:27:41,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:27:41,031 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:27:41,031 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:27:41,031 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:27:41,031 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:27:41,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:27:41,033 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-11-15 23:27:41,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:27:41,034 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:27:41,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:27:41,034 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:27:41,037 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:27:41,037 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:27:41,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:27:41,049 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-11-15 23:27:41,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:27:41,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:27:41,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:27:41,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:27:41,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:27:41,051 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:27:41,051 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:27:41,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:27:41,053 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-11-15 23:27:41,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:27:41,054 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:27:41,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:27:41,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:27:41,056 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:27:41,056 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:27:41,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:27:41,060 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-11-15 23:27:41,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:27:41,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:27:41,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:27:41,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:27:41,065 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:27:41,065 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:27:41,130 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:27:41,192 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:27:41,192 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:27:41,194 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:27:41,196 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:27:41,196 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:27:41,197 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 21 Supporting invariants [] [2019-11-15 23:27:41,209 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 23:27:41,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:41,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:27:41,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:41,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:27:41,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:41,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:41,286 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-11-15 23:27:41,287 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-11-15 23:27:41,329 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-11-15 23:27:41,330 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-11-15 23:27:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:27:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-11-15 23:27:41,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-15 23:27:41,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:27:41,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 23:27:41,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:27:41,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 23:27:41,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:27:41,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2019-11-15 23:27:41,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:41,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 7 states and 9 transitions. [2019-11-15 23:27:41,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-15 23:27:41,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-15 23:27:41,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-11-15 23:27:41,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:27:41,343 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-15 23:27:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-11-15 23:27:41,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-15 23:27:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:27:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-15 23:27:41,366 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-15 23:27:41,366 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-15 23:27:41,366 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:27:41,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-11-15 23:27:41,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:41,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:41,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:41,367 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 23:27:41,367 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:27:41,368 INFO L791 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:41,368 INFO L793 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-11-15 23:27:41,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:41,368 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-15 23:27:41,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:41,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464690340] [2019-11-15 23:27:41,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:41,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:41,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:41,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464690340] [2019-11-15 23:27:41,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:41,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:27:41,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140534864] [2019-11-15 23:27:41,410 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:27:41,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:41,410 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2019-11-15 23:27:41,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:41,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399668477] [2019-11-15 23:27:41,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:41,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:41,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:41,435 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:41,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:41,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:27:41,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:27:41,525 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-15 23:27:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:41,541 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-15 23:27:41,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:27:41,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-15 23:27:41,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:41,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-11-15 23:27:41,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:27:41,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:27:41,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-11-15 23:27:41,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:27:41,544 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-15 23:27:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-11-15 23:27:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-11-15 23:27:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:27:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-11-15 23:27:41,546 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 23:27:41,546 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 23:27:41,546 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:27:41,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-11-15 23:27:41,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:41,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:41,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:41,547 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:27:41,547 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:27:41,547 INFO L791 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:41,547 INFO L793 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-11-15 23:27:41,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:41,548 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-15 23:27:41,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:41,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038697012] [2019-11-15 23:27:41,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:41,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:41,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:41,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038697012] [2019-11-15 23:27:41,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265025131] [2019-11-15 23:27:41,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:27:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:41,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:27:41,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:41,650 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:27:41,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 23:27:41,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352596732] [2019-11-15 23:27:41,651 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:27:41,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:41,651 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2019-11-15 23:27:41,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:41,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556584598] [2019-11-15 23:27:41,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:41,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:41,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:41,668 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:41,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:41,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:27:41,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:27:41,743 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-11-15 23:27:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:41,782 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-11-15 23:27:41,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:27:41,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-11-15 23:27:41,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:41,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-11-15 23:27:41,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:27:41,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:27:41,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-11-15 23:27:41,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:27:41,785 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-15 23:27:41,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-11-15 23:27:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-11-15 23:27:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 23:27:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-15 23:27:41,787 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-15 23:27:41,787 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-15 23:27:41,787 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:27:41,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-15 23:27:41,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:41,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:41,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:41,788 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-15 23:27:41,789 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:27:41,789 INFO L791 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:41,789 INFO L793 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-11-15 23:27:41,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:41,789 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-15 23:27:41,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:41,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249077937] [2019-11-15 23:27:41,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:41,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:41,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:41,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249077937] [2019-11-15 23:27:41,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068854839] [2019-11-15 23:27:41,823 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:27:41,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:27:41,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:27:41,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:27:41,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:41,888 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:27:41,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-15 23:27:41,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880697349] [2019-11-15 23:27:41,889 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:27:41,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:41,890 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2019-11-15 23:27:41,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:41,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933172568] [2019-11-15 23:27:41,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:41,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:41,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:41,907 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:41,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:41,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:27:41,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:27:41,979 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-11-15 23:27:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:42,014 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-15 23:27:42,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:27:42,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-11-15 23:27:42,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:42,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-11-15 23:27:42,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:27:42,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:27:42,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-11-15 23:27:42,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:27:42,017 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-15 23:27:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-11-15 23:27:42,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-11-15 23:27:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 23:27:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-11-15 23:27:42,019 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-15 23:27:42,019 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-15 23:27:42,019 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:27:42,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-11-15 23:27:42,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:42,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:42,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:42,021 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-15 23:27:42,021 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:27:42,021 INFO L791 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:42,021 INFO L793 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-11-15 23:27:42,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:42,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-15 23:27:42,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:42,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397167625] [2019-11-15 23:27:42,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:42,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397167625] [2019-11-15 23:27:42,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941687620] [2019-11-15 23:27:42,075 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:27:42,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 23:27:42,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:27:42,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:27:42,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:42,164 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:27:42,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 23:27:42,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564359568] [2019-11-15 23:27:42,166 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:27:42,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:42,166 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2019-11-15 23:27:42,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:42,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430646412] [2019-11-15 23:27:42,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:42,191 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:42,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:42,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:27:42,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:27:42,257 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-15 23:27:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:42,288 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-11-15 23:27:42,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:27:42,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2019-11-15 23:27:42,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:42,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2019-11-15 23:27:42,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:27:42,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:27:42,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2019-11-15 23:27:42,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:27:42,290 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-15 23:27:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2019-11-15 23:27:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-11-15 23:27:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 23:27:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-15 23:27:42,292 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-15 23:27:42,292 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-15 23:27:42,292 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:27:42,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-11-15 23:27:42,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:42,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:42,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:42,294 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-15 23:27:42,294 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:27:42,294 INFO L791 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:42,294 INFO L793 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-11-15 23:27:42,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:42,295 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-15 23:27:42,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:42,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260314550] [2019-11-15 23:27:42,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:42,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260314550] [2019-11-15 23:27:42,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868067062] [2019-11-15 23:27:42,352 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:27:42,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:27:42,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:27:42,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:27:42,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:42,426 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:27:42,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-15 23:27:42,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385676345] [2019-11-15 23:27:42,427 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:27:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2019-11-15 23:27:42,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:42,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916979531] [2019-11-15 23:27:42,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:42,455 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:42,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:42,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:27:42,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:27:42,539 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 8 states. [2019-11-15 23:27:42,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:42,589 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-11-15 23:27:42,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:27:42,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-11-15 23:27:42,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:42,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-11-15 23:27:42,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:27:42,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:27:42,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-11-15 23:27:42,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:27:42,591 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-15 23:27:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-11-15 23:27:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-11-15 23:27:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 23:27:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-15 23:27:42,593 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-15 23:27:42,593 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-15 23:27:42,593 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:27:42,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-15 23:27:42,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:42,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:42,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:42,594 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-15 23:27:42,594 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:27:42,595 INFO L791 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:42,595 INFO L793 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-11-15 23:27:42,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-15 23:27:42,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:42,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831503572] [2019-11-15 23:27:42,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:42,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831503572] [2019-11-15 23:27:42,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826070548] [2019-11-15 23:27:42,652 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:27:42,705 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-15 23:27:42,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:27:42,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:27:42,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:42,722 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:27:42,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-15 23:27:42,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806354224] [2019-11-15 23:27:42,723 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:27:42,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:42,723 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2019-11-15 23:27:42,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:42,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028250510] [2019-11-15 23:27:42,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:42,735 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:42,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:42,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:27:42,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:27:42,812 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 9 states. [2019-11-15 23:27:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:42,862 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-11-15 23:27:42,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:27:42,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2019-11-15 23:27:42,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:42,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2019-11-15 23:27:42,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:27:42,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:27:42,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2019-11-15 23:27:42,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:27:42,865 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-15 23:27:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2019-11-15 23:27:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-15 23:27:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 23:27:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-15 23:27:42,867 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-15 23:27:42,867 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-15 23:27:42,867 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:27:42,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-11-15 23:27:42,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:42,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:42,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:42,869 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2019-11-15 23:27:42,869 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:27:42,869 INFO L791 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:42,869 INFO L793 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-11-15 23:27:42,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:42,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2019-11-15 23:27:42,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:42,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919889217] [2019-11-15 23:27:42,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:42,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:42,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919889217] [2019-11-15 23:27:42,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790984662] [2019-11-15 23:27:42,946 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:27:43,011 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-15 23:27:43,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:27:43,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:27:43,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:43,024 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:27:43,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-15 23:27:43,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322939083] [2019-11-15 23:27:43,025 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:27:43,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:43,025 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2019-11-15 23:27:43,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:43,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063744555] [2019-11-15 23:27:43,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:43,036 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:43,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:43,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:27:43,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:27:43,107 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2019-11-15 23:27:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:43,148 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-15 23:27:43,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:27:43,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-11-15 23:27:43,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:43,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2019-11-15 23:27:43,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:27:43,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:27:43,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2019-11-15 23:27:43,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:27:43,150 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-15 23:27:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2019-11-15 23:27:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-15 23:27:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:27:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-11-15 23:27:43,152 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-15 23:27:43,152 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-15 23:27:43,152 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:27:43,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2019-11-15 23:27:43,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:43,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:43,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:43,154 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2019-11-15 23:27:43,154 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:27:43,154 INFO L791 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:43,154 INFO L793 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-11-15 23:27:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:43,154 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2019-11-15 23:27:43,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:43,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366426503] [2019-11-15 23:27:43,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:43,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366426503] [2019-11-15 23:27:43,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38773175] [2019-11-15 23:27:43,243 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:27:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:43,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:27:43,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:43,331 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:27:43,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-15 23:27:43,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408753140] [2019-11-15 23:27:43,332 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:27:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:43,332 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2019-11-15 23:27:43,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:43,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484323000] [2019-11-15 23:27:43,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:43,352 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:43,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:43,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:27:43,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:27:43,424 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 11 states. [2019-11-15 23:27:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:43,466 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-15 23:27:43,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:27:43,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2019-11-15 23:27:43,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:43,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2019-11-15 23:27:43,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:27:43,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:27:43,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2019-11-15 23:27:43,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:27:43,468 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-15 23:27:43,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2019-11-15 23:27:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-11-15 23:27:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 23:27:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-15 23:27:43,470 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-15 23:27:43,470 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-15 23:27:43,470 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:27:43,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-11-15 23:27:43,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:43,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:43,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:43,472 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2019-11-15 23:27:43,472 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:27:43,472 INFO L791 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:43,472 INFO L793 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-11-15 23:27:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2019-11-15 23:27:43,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:43,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945704885] [2019-11-15 23:27:43,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:43,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945704885] [2019-11-15 23:27:43,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159580702] [2019-11-15 23:27:43,566 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/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-11-15 23:27:43,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:27:43,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:27:43,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:27:43,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:43,623 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:27:43,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-15 23:27:43,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364143080] [2019-11-15 23:27:43,624 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:27:43,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:43,624 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2019-11-15 23:27:43,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:43,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258214968] [2019-11-15 23:27:43,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:43,631 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:43,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:43,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:27:43,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:27:43,709 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 12 states. [2019-11-15 23:27:43,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:43,762 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-11-15 23:27:43,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:27:43,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2019-11-15 23:27:43,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:43,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2019-11-15 23:27:43,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:27:43,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 23:27:43,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2019-11-15 23:27:43,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:27:43,764 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-15 23:27:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2019-11-15 23:27:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-11-15 23:27:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 23:27:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-15 23:27:43,766 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-15 23:27:43,766 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-15 23:27:43,767 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:27:43,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2019-11-15 23:27:43,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:43,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:43,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:43,768 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2019-11-15 23:27:43,770 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:27:43,770 INFO L791 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:43,770 INFO L793 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-11-15 23:27:43,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:43,771 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2019-11-15 23:27:43,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:43,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354242748] [2019-11-15 23:27:43,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:43,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354242748] [2019-11-15 23:27:43,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254700516] [2019-11-15 23:27:43,889 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/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-11-15 23:27:43,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-15 23:27:43,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:27:43,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:27:43,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:43,996 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:27:43,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-15 23:27:43,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196894912] [2019-11-15 23:27:43,997 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:27:43,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2019-11-15 23:27:43,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:43,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009420271] [2019-11-15 23:27:43,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:43,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:44,005 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:44,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:44,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:27:44,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:27:44,064 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2019-11-15 23:27:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:44,124 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-11-15 23:27:44,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:27:44,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-11-15 23:27:44,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:44,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2019-11-15 23:27:44,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:27:44,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:27:44,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2019-11-15 23:27:44,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:27:44,127 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-11-15 23:27:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2019-11-15 23:27:44,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-11-15 23:27:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 23:27:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-15 23:27:44,129 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-15 23:27:44,129 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-15 23:27:44,129 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 23:27:44,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2019-11-15 23:27:44,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:44,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:44,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:44,130 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2019-11-15 23:27:44,130 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:27:44,131 INFO L791 eck$LassoCheckResult]: Stem: 874#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:44,131 INFO L793 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-11-15 23:27:44,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:44,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2019-11-15 23:27:44,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:44,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469932123] [2019-11-15 23:27:44,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:44,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:44,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:44,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469932123] [2019-11-15 23:27:44,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555806034] [2019-11-15 23:27:44,255 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6d489b-2929-4544-b301-9d746a146c67/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-11-15 23:27:44,316 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 23:27:44,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:27:44,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:27:44,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:27:44,335 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:27:44,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-11-15 23:27:44,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8568463] [2019-11-15 23:27:44,336 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:27:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2019-11-15 23:27:44,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:44,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361301351] [2019-11-15 23:27:44,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:44,338 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:44,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:44,355 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:44,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:27:44,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:27:44,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:27:44,411 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 14 states. [2019-11-15 23:27:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:44,473 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-11-15 23:27:44,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:27:44,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2019-11-15 23:27:44,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:44,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2019-11-15 23:27:44,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 23:27:44,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:27:44,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2019-11-15 23:27:44,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:27:44,475 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-15 23:27:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2019-11-15 23:27:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-11-15 23:27:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 23:27:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-15 23:27:44,478 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-15 23:27:44,478 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-15 23:27:44,479 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 23:27:44,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2019-11-15 23:27:44,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 23:27:44,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:27:44,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:27:44,480 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2019-11-15 23:27:44,480 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 23:27:44,480 INFO L791 eck$LassoCheckResult]: Stem: 1014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:27:44,480 INFO L793 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-11-15 23:27:44,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2019-11-15 23:27:44,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:44,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955094548] [2019-11-15 23:27:44,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:44,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:44,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:44,515 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:44,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:44,515 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2019-11-15 23:27:44,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:44,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514428463] [2019-11-15 23:27:44,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:44,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:44,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:44,523 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:27:44,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:44,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2019-11-15 23:27:44,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:27:44,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707597786] [2019-11-15 23:27:44,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:44,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:27:44,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:27:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:27:44,566 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:28:08,707 WARN L191 SmtUtils]: Spent 24.10 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 23:28:17,883 WARN L191 SmtUtils]: Spent 9.17 s on a formula simplification. DAG size of input: 216 DAG size of output: 164 [2019-11-15 23:28:18,113 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-15 23:28:18,115 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:28:18,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:28:18,115 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:28:18,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:28:18,115 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:28:18,115 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:28:18,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:28:18,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:28:18,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration13_Lasso [2019-11-15 23:28:18,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:28:18,116 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:28:18,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:28:18,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:28:18,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:28:18,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:28:18,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:28:18,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:28:18,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-11-15 23:28:18,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:28:18,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:28:18,591 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-11-15 23:28:18,604 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:28:18,604 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:28:18,605 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-11-15 23:28:18,605 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:28:18,606 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:28:18,606 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:28:18,606 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:28:18,606 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:28:18,606 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:28:18,607 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:28:18,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:28:18,608 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-11-15 23:28:18,608 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:28:18,608 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:28:18,608 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:28:18,608 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:28:18,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:28:18,609 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:28:18,609 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:28:18,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:28:18,610 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-11-15 23:28:18,610 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:28:18,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:28:18,610 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:28:18,610 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:28:18,612 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:28:18,612 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:28:18,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:28:18,613 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-11-15 23:28:18,613 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:28:18,614 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:28:18,614 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:28:18,614 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:28:18,614 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:28:18,614 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:28:18,614 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:28:18,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:28:18,615 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-11-15 23:28:18,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:28:18,616 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:28:18,616 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:28:18,616 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:28:18,617 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:28:18,618 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:28:18,618 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:28:18,618 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:28:18,619 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-11-15 23:28:18,619 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:28:18,620 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:28:18,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:28:18,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:28:18,622 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:28:18,622 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:28:18,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:28:18,625 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-11-15 23:28:18,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:28:18,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:28:18,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:28:18,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:28:18,628 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:28:18,628 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:28:18,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:28:18,630 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-11-15 23:28:18,630 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:28:18,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:28:18,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:28:18,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:28:18,633 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:28:18,633 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:28:18,642 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:28:18,649 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:28:18,650 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:28:18,650 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:28:18,651 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:28:18,651 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:28:18,651 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#in~0.offset, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2, ULTIMATE.start_main_~idx_in~0) = -1*ULTIMATE.start_main_~#in~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2 - 1*ULTIMATE.start_main_~idx_in~0 Supporting invariants [] [2019-11-15 23:28:18,664 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-15 23:28:18,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:28:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:28:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:18,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:28:18,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:28:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:28:18,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:28:18,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:28:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:28:18,726 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-11-15 23:28:18,726 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 2 states. [2019-11-15 23:28:18,734 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-11-15 23:28:18,735 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-11-15 23:28:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 23:28:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2019-11-15 23:28:18,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2019-11-15 23:28:18,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:28:18,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2019-11-15 23:28:18,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:28:18,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2019-11-15 23:28:18,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:28:18,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-11-15 23:28:18,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:28:18,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2019-11-15 23:28:18,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:28:18,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:28:18,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:28:18,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:28:18,740 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:28:18,740 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:28:18,740 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:28:18,740 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 23:28:18,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:28:18,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:28:18,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:28:18,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:28:18 BoogieIcfgContainer [2019-11-15 23:28:18,747 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:28:18,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:28:18,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:28:18,747 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:28:18,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:27:40" (3/4) ... [2019-11-15 23:28:18,753 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:28:18,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:28:18,755 INFO L168 Benchmark]: Toolchain (without parser) took 39222.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 946.1 MB in the beginning and 782.6 MB in the end (delta: 163.5 MB). Peak memory consumption was 387.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:28:18,755 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:28:18,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:28:18,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:28:18,758 INFO L168 Benchmark]: Boogie Preprocessor took 21.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:28:18,762 INFO L168 Benchmark]: RCFGBuilder took 284.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:28:18,762 INFO L168 Benchmark]: BuchiAutomizer took 38544.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 782.6 MB in the end (delta: 317.1 MB). Peak memory consumption was 405.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:28:18,762 INFO L168 Benchmark]: Witness Printer took 5.83 ms. Allocated memory is still 1.3 GB. Free memory is still 782.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:28:18,770 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 284.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 38544.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 782.6 MB in the end (delta: 317.1 MB). Peak memory consumption was 405.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.83 ms. Allocated memory is still 1.3 GB. Free memory is still 782.6 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 * 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 and consists of 5 locations. One deterministic module has affine ranking function -1 * in + unknown-#length-unknown[in] + -1 * idx_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 38.4s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 37.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.3s. 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: 53 SDtfs, 73 SDslu, 57 SDs, 0 SdLazy, 298 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital153 mio100 ax100 hnf100 lsp95 ukn55 mio100 lsp57 div155 bol100 ite103 ukn100 eq156 hnf73 smp97 dnf130 smp98 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 3 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...