./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC --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 a92d749021b3b94f4ecd59f60bbcb6b80102c08a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 00:32:58,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:32:58,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:32:58,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:32:58,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:32:58,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:32:58,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:32:58,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:32:58,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:32:58,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:32:58,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:32:58,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:32:58,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:32:58,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:32:58,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:32:58,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:32:58,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:32:58,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:32:58,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:32:58,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:32:58,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:32:58,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:32:58,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:32:58,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:32:58,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:32:58,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:32:58,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:32:58,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:32:58,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:32:58,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:32:58,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:32:58,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:32:58,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:32:58,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:32:58,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:32:58,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:32:58,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:32:58,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:32:58,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:32:58,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:32:58,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:32:58,384 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-11 00:32:58,428 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:32:58,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:32:58,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:32:58,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:32:58,430 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:32:58,431 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-11 00:32:58,431 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-11 00:32:58,431 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-11 00:32:58,431 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-11 00:32:58,432 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-11 00:32:58,432 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-11 00:32:58,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:32:58,432 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:32:58,432 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-11 00:32:58,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:32:58,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:32:58,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:32:58,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-11 00:32:58,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-11 00:32:58,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-11 00:32:58,434 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:32:58,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:32:58,434 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-11 00:32:58,435 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:32:58,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-11 00:32:58,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:32:58,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:32:58,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:32:58,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:32:58,439 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:32:58,440 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-11 00:32:58,440 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC 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 -> a92d749021b3b94f4ecd59f60bbcb6b80102c08a [2021-10-11 00:32:58,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:32:58,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:32:58,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:32:58,740 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:32:58,741 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:32:58,742 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-10-11 00:32:58,806 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/data/f24421da9/9948652a70c14c8e80d16fcab87d607d/FLAGfc9a8266d [2021-10-11 00:32:59,262 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:32:59,262 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-10-11 00:32:59,269 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/data/f24421da9/9948652a70c14c8e80d16fcab87d607d/FLAGfc9a8266d [2021-10-11 00:32:59,633 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/data/f24421da9/9948652a70c14c8e80d16fcab87d607d [2021-10-11 00:32:59,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:32:59,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:32:59,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:32:59,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:32:59,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:32:59,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:32:59" (1/1) ... [2021-10-11 00:32:59,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dcc1156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59, skipping insertion in model container [2021-10-11 00:32:59,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:32:59" (1/1) ... [2021-10-11 00:32:59,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:32:59,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:32:59,839 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/sv-benchmarks/c/bitvector/byte_add_1-1.i[863,876] [2021-10-11 00:32:59,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:32:59,906 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:32:59,916 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/sv-benchmarks/c/bitvector/byte_add_1-1.i[863,876] [2021-10-11 00:32:59,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:32:59,951 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:32:59,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59 WrapperNode [2021-10-11 00:32:59,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:32:59,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:32:59,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:32:59,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:32:59,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59" (1/1) ... [2021-10-11 00:32:59,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59" (1/1) ... [2021-10-11 00:32:59,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:32:59,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:32:59,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:32:59,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:32:59,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59" (1/1) ... [2021-10-11 00:32:59,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59" (1/1) ... [2021-10-11 00:33:00,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59" (1/1) ... [2021-10-11 00:33:00,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59" (1/1) ... [2021-10-11 00:33:00,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59" (1/1) ... [2021-10-11 00:33:00,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59" (1/1) ... [2021-10-11 00:33:00,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59" (1/1) ... [2021-10-11 00:33:00,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:33:00,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:33:00,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:33:00,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:33:00,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:33:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:33:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:33:00,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:33:00,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:33:00,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:33:00,470 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-11 00:33:00,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:00 BoogieIcfgContainer [2021-10-11 00:33:00,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:33:00,481 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-11 00:33:00,481 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-11 00:33:00,484 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-11 00:33:00,485 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:33:00,485 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 11.10 12:32:59" (1/3) ... [2021-10-11 00:33:00,486 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42af163c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:33:00, skipping insertion in model container [2021-10-11 00:33:00,486 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:33:00,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:59" (2/3) ... [2021-10-11 00:33:00,487 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42af163c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:33:00, skipping insertion in model container [2021-10-11 00:33:00,487 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:33:00,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:00" (3/3) ... [2021-10-11 00:33:00,489 INFO L389 chiAutomizerObserver]: Analyzing ICFG byte_add_1-1.i [2021-10-11 00:33:00,532 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-11 00:33:00,532 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-11 00:33:00,532 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-11 00:33:00,532 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:33:00,532 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:33:00,532 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-11 00:33:00,533 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:33:00,533 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-11 00:33:00,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2021-10-11 00:33:00,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-10-11 00:33:00,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:00,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:00,569 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-10-11 00:33:00,569 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:00,569 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-11 00:33:00,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. [2021-10-11 00:33:00,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-10-11 00:33:00,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:00,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:00,574 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-10-11 00:33:00,574 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:00,579 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 13#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10#L51true assume !(0 == mp_add_~a3~0 % 256); 8#L51-1true mp_add_~nb~0 := 4; 32#L61true assume !(0 == mp_add_~b3~0 % 256); 30#L61-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 26#L72-2true [2021-10-11 00:33:00,580 INFO L796 eck$LassoCheckResult]: Loop: 26#L72-2true assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37#L75true assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34#L75-1true assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 28#L81true assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 16#L87-1true assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3#L91-1true assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 25#L92-1true assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7#L93-1true assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 33#L94-1true mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26#L72-2true [2021-10-11 00:33:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2021-10-11 00:33:00,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:00,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075230906] [2021-10-11 00:33:00,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:00,748 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:00,804 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:00,836 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:00,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:00,843 INFO L82 PathProgramCache]: Analyzing trace with hash 318197182, now seen corresponding path program 1 times [2021-10-11 00:33:00,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:00,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767448597] [2021-10-11 00:33:00,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:00,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767448597] [2021-10-11 00:33:00,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:00,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:00,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526802541] [2021-10-11 00:33:00,956 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:00,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:00,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:00,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:00,974 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2021-10-11 00:33:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:01,208 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2021-10-11 00:33:01,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:01,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 94 transitions. [2021-10-11 00:33:01,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2021-10-11 00:33:01,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 56 states and 86 transitions. [2021-10-11 00:33:01,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-10-11 00:33:01,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-10-11 00:33:01,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 86 transitions. [2021-10-11 00:33:01,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:01,239 INFO L692 BuchiCegarLoop]: Abstraction has 56 states and 86 transitions. [2021-10-11 00:33:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 86 transitions. [2021-10-11 00:33:01,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2021-10-11 00:33:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-10-11 00:33:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 84 transitions. [2021-10-11 00:33:01,275 INFO L715 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-10-11 00:33:01,275 INFO L595 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-10-11 00:33:01,275 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-11 00:33:01,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 84 transitions. [2021-10-11 00:33:01,279 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-10-11 00:33:01,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:01,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:01,283 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:01,283 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:01,284 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 129#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 125#L51 assume !(0 == mp_add_~a3~0 % 256); 122#L51-1 mp_add_~nb~0 := 4; 123#L61 assume !(0 == mp_add_~b3~0 % 256); 131#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 144#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 145#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 140#L75-1 [2021-10-11 00:33:01,284 INFO L796 eck$LassoCheckResult]: Loop: 140#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 128#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 135#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 114#L91-1 assume !(1 == mp_add_~i~0 % 256); 115#L92-1 assume !(2 == mp_add_~i~0 % 256); 120#L93-1 assume !(3 == mp_add_~i~0 % 256); 121#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 148#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 157#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 158#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 133#L76-2 assume !(1 == mp_add_~i~0 % 256); 134#L77-1 assume !(2 == mp_add_~i~0 % 256); 139#L78-1 assume !(3 == mp_add_~i~0 % 256); 140#L75-1 [2021-10-11 00:33:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:01,286 INFO L82 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2021-10-11 00:33:01,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:01,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763550344] [2021-10-11 00:33:01,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:01,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763550344] [2021-10-11 00:33:01,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:01,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:33:01,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996578959] [2021-10-11 00:33:01,522 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:33:01,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:01,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 1 times [2021-10-11 00:33:01,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:01,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138042072] [2021-10-11 00:33:01,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:01,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138042072] [2021-10-11 00:33:01,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:01,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:01,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604610921] [2021-10-11 00:33:01,634 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:01,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:01,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:33:01,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:01,635 INFO L87 Difference]: Start difference. First operand 54 states and 84 transitions. cyclomatic complexity: 32 Second operand 6 states. [2021-10-11 00:33:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:02,245 INFO L93 Difference]: Finished difference Result 177 states and 257 transitions. [2021-10-11 00:33:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:33:02,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 257 transitions. [2021-10-11 00:33:02,251 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 117 [2021-10-11 00:33:02,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 177 states and 257 transitions. [2021-10-11 00:33:02,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2021-10-11 00:33:02,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2021-10-11 00:33:02,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 257 transitions. [2021-10-11 00:33:02,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:02,263 INFO L692 BuchiCegarLoop]: Abstraction has 177 states and 257 transitions. [2021-10-11 00:33:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 257 transitions. [2021-10-11 00:33:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 69. [2021-10-11 00:33:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-10-11 00:33:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 102 transitions. [2021-10-11 00:33:02,281 INFO L715 BuchiCegarLoop]: Abstraction has 69 states and 102 transitions. [2021-10-11 00:33:02,281 INFO L595 BuchiCegarLoop]: Abstraction has 69 states and 102 transitions. [2021-10-11 00:33:02,281 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-11 00:33:02,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 102 transitions. [2021-10-11 00:33:02,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-10-11 00:33:02,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:02,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:02,286 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:02,287 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:02,287 INFO L794 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 378#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 375#L51 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 377#L53 assume !(0 == mp_add_~a2~0 % 256); 371#L51-1 mp_add_~nb~0 := 4; 372#L61 assume !(0 == mp_add_~b3~0 % 256); 395#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 396#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 414#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 389#L75-1 [2021-10-11 00:33:02,288 INFO L796 eck$LassoCheckResult]: Loop: 389#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 374#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 384#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 362#L91-1 assume !(1 == mp_add_~i~0 % 256); 363#L92-1 assume !(2 == mp_add_~i~0 % 256); 368#L93-1 assume !(3 == mp_add_~i~0 % 256); 369#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 397#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 407#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 423#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 382#L76-2 assume !(1 == mp_add_~i~0 % 256); 383#L77-1 assume !(2 == mp_add_~i~0 % 256); 388#L78-1 assume !(3 == mp_add_~i~0 % 256); 389#L75-1 [2021-10-11 00:33:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:02,289 INFO L82 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2021-10-11 00:33:02,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:02,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525028696] [2021-10-11 00:33:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:02,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525028696] [2021-10-11 00:33:02,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:02,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:02,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739923969] [2021-10-11 00:33:02,389 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:33:02,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:02,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 2 times [2021-10-11 00:33:02,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:02,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246545353] [2021-10-11 00:33:02,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:02,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246545353] [2021-10-11 00:33:02,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:02,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:02,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35158749] [2021-10-11 00:33:02,448 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:02,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:02,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:02,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:02,449 INFO L87 Difference]: Start difference. First operand 69 states and 102 transitions. cyclomatic complexity: 35 Second operand 3 states. [2021-10-11 00:33:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:02,455 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2021-10-11 00:33:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:02,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 83 transitions. [2021-10-11 00:33:02,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-10-11 00:33:02,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 83 transitions. [2021-10-11 00:33:02,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2021-10-11 00:33:02,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2021-10-11 00:33:02,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 83 transitions. [2021-10-11 00:33:02,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:02,459 INFO L692 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2021-10-11 00:33:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 83 transitions. [2021-10-11 00:33:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-10-11 00:33:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-10-11 00:33:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2021-10-11 00:33:02,463 INFO L715 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2021-10-11 00:33:02,463 INFO L595 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2021-10-11 00:33:02,464 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-11 00:33:02,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. [2021-10-11 00:33:02,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-10-11 00:33:02,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:02,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:02,466 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:02,466 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:02,466 INFO L794 eck$LassoCheckResult]: Stem: 530#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 511#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 508#L51 assume !(0 == mp_add_~a3~0 % 256); 505#L51-1 mp_add_~nb~0 := 4; 506#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 512#L63 assume !(0 == mp_add_~b2~0 % 256); 513#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 525#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 526#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 531#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 547#L76-2 [2021-10-11 00:33:02,466 INFO L796 eck$LassoCheckResult]: Loop: 547#L76-2 assume !(1 == mp_add_~i~0 % 256); 545#L77-1 assume !(2 == mp_add_~i~0 % 256); 541#L78-1 assume !(3 == mp_add_~i~0 % 256); 538#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 510#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 517#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 497#L91-1 assume !(1 == mp_add_~i~0 % 256); 498#L92-1 assume !(2 == mp_add_~i~0 % 256); 503#L93-1 assume !(3 == mp_add_~i~0 % 256); 504#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 529#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 535#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 542#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 547#L76-2 [2021-10-11 00:33:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 1 times [2021-10-11 00:33:02,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:02,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236077940] [2021-10-11 00:33:02,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:02,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:02,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:02,525 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:02,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:02,526 INFO L82 PathProgramCache]: Analyzing trace with hash 119486142, now seen corresponding path program 3 times [2021-10-11 00:33:02,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:02,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621913272] [2021-10-11 00:33:02,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:02,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621913272] [2021-10-11 00:33:02,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:02,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:02,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063114123] [2021-10-11 00:33:02,579 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:02,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:02,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:02,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:02,580 INFO L87 Difference]: Start difference. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 4 states. [2021-10-11 00:33:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:02,763 INFO L93 Difference]: Finished difference Result 83 states and 124 transitions. [2021-10-11 00:33:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:33:02,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 124 transitions. [2021-10-11 00:33:02,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2021-10-11 00:33:02,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 83 states and 124 transitions. [2021-10-11 00:33:02,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2021-10-11 00:33:02,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2021-10-11 00:33:02,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 124 transitions. [2021-10-11 00:33:02,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:02,770 INFO L692 BuchiCegarLoop]: Abstraction has 83 states and 124 transitions. [2021-10-11 00:33:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 124 transitions. [2021-10-11 00:33:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2021-10-11 00:33:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2021-10-11 00:33:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 110 transitions. [2021-10-11 00:33:02,785 INFO L715 BuchiCegarLoop]: Abstraction has 75 states and 110 transitions. [2021-10-11 00:33:02,785 INFO L595 BuchiCegarLoop]: Abstraction has 75 states and 110 transitions. [2021-10-11 00:33:02,785 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-11 00:33:02,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 110 transitions. [2021-10-11 00:33:02,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2021-10-11 00:33:02,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:02,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:02,791 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:02,792 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:02,792 INFO L794 eck$LassoCheckResult]: Stem: 678#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 659#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 658#L51 assume !(0 == mp_add_~a3~0 % 256); 653#L51-1 mp_add_~nb~0 := 4; 654#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 660#L63 assume !(0 == mp_add_~b2~0 % 256); 661#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 672#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 673#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 679#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 715#L76-2 [2021-10-11 00:33:02,793 INFO L796 eck$LassoCheckResult]: Loop: 715#L76-2 assume !(1 == mp_add_~i~0 % 256); 713#L77-1 assume !(2 == mp_add_~i~0 % 256); 711#L78-1 assume !(3 == mp_add_~i~0 % 256); 708#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 657#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 693#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 691#L91-1 assume !(1 == mp_add_~i~0 % 256); 690#L92-1 assume !(2 == mp_add_~i~0 % 256); 689#L93-1 assume !(3 == mp_add_~i~0 % 256); 688#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 683#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 684#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 697#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 675#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 665#L87-1 assume !(0 == mp_add_~i~0 % 256); 645#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 646#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 651#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 652#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 676#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 687#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 710#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 715#L76-2 [2021-10-11 00:33:02,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:02,794 INFO L82 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 2 times [2021-10-11 00:33:02,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:02,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289376810] [2021-10-11 00:33:02,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:02,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:02,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:02,895 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:02,896 INFO L82 PathProgramCache]: Analyzing trace with hash 522403369, now seen corresponding path program 1 times [2021-10-11 00:33:02,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:02,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520764998] [2021-10-11 00:33:02,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 00:33:02,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520764998] [2021-10-11 00:33:02,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:02,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:02,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686182181] [2021-10-11 00:33:02,942 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:02,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:02,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:02,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:02,943 INFO L87 Difference]: Start difference. First operand 75 states and 110 transitions. cyclomatic complexity: 37 Second operand 3 states. [2021-10-11 00:33:03,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:03,052 INFO L93 Difference]: Finished difference Result 100 states and 144 transitions. [2021-10-11 00:33:03,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:03,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 144 transitions. [2021-10-11 00:33:03,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2021-10-11 00:33:03,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 144 transitions. [2021-10-11 00:33:03,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2021-10-11 00:33:03,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2021-10-11 00:33:03,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 144 transitions. [2021-10-11 00:33:03,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:03,062 INFO L692 BuchiCegarLoop]: Abstraction has 100 states and 144 transitions. [2021-10-11 00:33:03,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 144 transitions. [2021-10-11 00:33:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2021-10-11 00:33:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2021-10-11 00:33:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2021-10-11 00:33:03,074 INFO L715 BuchiCegarLoop]: Abstraction has 98 states and 142 transitions. [2021-10-11 00:33:03,074 INFO L595 BuchiCegarLoop]: Abstraction has 98 states and 142 transitions. [2021-10-11 00:33:03,074 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-11 00:33:03,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 142 transitions. [2021-10-11 00:33:03,075 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2021-10-11 00:33:03,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:03,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:03,077 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:03,077 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:03,078 INFO L794 eck$LassoCheckResult]: Stem: 864#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 841#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 840#L51 assume !(0 == mp_add_~a3~0 % 256); 836#L51-1 mp_add_~nb~0 := 4; 837#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 842#L63 assume !(0 == mp_add_~b2~0 % 256); 843#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 856#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 857#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 865#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 908#L76-2 [2021-10-11 00:33:03,078 INFO L796 eck$LassoCheckResult]: Loop: 908#L76-2 assume !(1 == mp_add_~i~0 % 256); 917#L77-1 assume !(2 == mp_add_~i~0 % 256); 915#L78-1 assume !(3 == mp_add_~i~0 % 256); 914#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 912#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 847#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 826#L91-1 assume !(1 == mp_add_~i~0 % 256); 827#L92-1 assume !(2 == mp_add_~i~0 % 256); 832#L93-1 assume !(3 == mp_add_~i~0 % 256); 833#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 860#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 872#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 852#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 839#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 858#L87-1 assume !(0 == mp_add_~i~0 % 256); 883#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 881#L92-1 assume !(2 == mp_add_~i~0 % 256); 879#L93-1 assume !(3 == mp_add_~i~0 % 256); 873#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 870#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 871#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 896#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 908#L76-2 [2021-10-11 00:33:03,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:03,078 INFO L82 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 3 times [2021-10-11 00:33:03,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:03,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246172411] [2021-10-11 00:33:03,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:03,120 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:03,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:03,151 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:03,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:03,152 INFO L82 PathProgramCache]: Analyzing trace with hash 581508713, now seen corresponding path program 1 times [2021-10-11 00:33:03,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:03,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107462176] [2021-10-11 00:33:03,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:03,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107462176] [2021-10-11 00:33:03,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:03,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:03,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27031557] [2021-10-11 00:33:03,225 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:03,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:03,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:03,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:03,226 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. cyclomatic complexity: 46 Second operand 4 states. [2021-10-11 00:33:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:03,304 INFO L93 Difference]: Finished difference Result 166 states and 244 transitions. [2021-10-11 00:33:03,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:33:03,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 244 transitions. [2021-10-11 00:33:03,306 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 147 [2021-10-11 00:33:03,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 166 states and 244 transitions. [2021-10-11 00:33:03,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2021-10-11 00:33:03,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2021-10-11 00:33:03,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 244 transitions. [2021-10-11 00:33:03,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:03,309 INFO L692 BuchiCegarLoop]: Abstraction has 166 states and 244 transitions. [2021-10-11 00:33:03,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 244 transitions. [2021-10-11 00:33:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 138. [2021-10-11 00:33:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2021-10-11 00:33:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 206 transitions. [2021-10-11 00:33:03,315 INFO L715 BuchiCegarLoop]: Abstraction has 138 states and 206 transitions. [2021-10-11 00:33:03,315 INFO L595 BuchiCegarLoop]: Abstraction has 138 states and 206 transitions. [2021-10-11 00:33:03,315 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-11 00:33:03,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 206 transitions. [2021-10-11 00:33:03,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 119 [2021-10-11 00:33:03,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:03,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:03,318 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:03,318 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:03,318 INFO L794 eck$LassoCheckResult]: Stem: 1136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 1111#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1110#L51 assume !(0 == mp_add_~a3~0 % 256); 1106#L51-1 mp_add_~nb~0 := 4; 1107#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1112#L63 assume !(0 == mp_add_~b2~0 % 256); 1113#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1127#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1128#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1137#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1193#L76-2 [2021-10-11 00:33:03,319 INFO L796 eck$LassoCheckResult]: Loop: 1193#L76-2 assume !(1 == mp_add_~i~0 % 256); 1192#L77-1 assume !(2 == mp_add_~i~0 % 256); 1188#L78-1 assume !(3 == mp_add_~i~0 % 256); 1184#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1172#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1117#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1097#L91-1 assume !(1 == mp_add_~i~0 % 256); 1098#L92-1 assume !(2 == mp_add_~i~0 % 256); 1229#L93-1 assume !(3 == mp_add_~i~0 % 256); 1228#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1227#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1224#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1210#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1131#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1132#L87-1 assume !(0 == mp_add_~i~0 % 256); 1158#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 1155#L92-1 assume !(2 == mp_add_~i~0 % 256); 1154#L93-1 assume !(3 == mp_add_~i~0 % 256); 1151#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1147#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1148#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1216#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1193#L76-2 [2021-10-11 00:33:03,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 4 times [2021-10-11 00:33:03,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:03,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006684213] [2021-10-11 00:33:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:03,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:03,350 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:03,354 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1261567083, now seen corresponding path program 1 times [2021-10-11 00:33:03,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:03,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961018397] [2021-10-11 00:33:03,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 00:33:03,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961018397] [2021-10-11 00:33:03,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:03,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:03,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613580612] [2021-10-11 00:33:03,427 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:03,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:03,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:03,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:03,428 INFO L87 Difference]: Start difference. First operand 138 states and 206 transitions. cyclomatic complexity: 70 Second operand 4 states. [2021-10-11 00:33:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:03,635 INFO L93 Difference]: Finished difference Result 202 states and 298 transitions. [2021-10-11 00:33:03,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:03,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 298 transitions. [2021-10-11 00:33:03,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 183 [2021-10-11 00:33:03,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 202 states and 298 transitions. [2021-10-11 00:33:03,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 202 [2021-10-11 00:33:03,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 202 [2021-10-11 00:33:03,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 202 states and 298 transitions. [2021-10-11 00:33:03,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:03,641 INFO L692 BuchiCegarLoop]: Abstraction has 202 states and 298 transitions. [2021-10-11 00:33:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 298 transitions. [2021-10-11 00:33:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 134. [2021-10-11 00:33:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-10-11 00:33:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 201 transitions. [2021-10-11 00:33:03,646 INFO L715 BuchiCegarLoop]: Abstraction has 134 states and 201 transitions. [2021-10-11 00:33:03,646 INFO L595 BuchiCegarLoop]: Abstraction has 134 states and 201 transitions. [2021-10-11 00:33:03,647 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-11 00:33:03,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 201 transitions. [2021-10-11 00:33:03,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 115 [2021-10-11 00:33:03,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:03,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:03,649 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:03,649 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:03,649 INFO L794 eck$LassoCheckResult]: Stem: 1489#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 1462#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1458#L51 assume !(0 == mp_add_~a3~0 % 256); 1455#L51-1 mp_add_~nb~0 := 4; 1456#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1463#L63 assume !(0 == mp_add_~b2~0 % 256); 1464#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1553#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1551#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1538#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1537#L76-2 [2021-10-11 00:33:03,649 INFO L796 eck$LassoCheckResult]: Loop: 1537#L76-2 assume !(1 == mp_add_~i~0 % 256); 1534#L77-1 assume !(2 == mp_add_~i~0 % 256); 1528#L78-1 assume !(3 == mp_add_~i~0 % 256); 1523#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1518#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1514#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1511#L91-1 assume !(1 == mp_add_~i~0 % 256); 1506#L92-1 assume !(2 == mp_add_~i~0 % 256); 1508#L93-1 assume !(3 == mp_add_~i~0 % 256); 1502#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1498#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1499#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1474#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1460#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1507#L87-1 assume !(0 == mp_add_~i~0 % 256); 1505#L91-1 assume !(1 == mp_add_~i~0 % 256); 1503#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 1501#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 1497#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1495#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1496#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1549#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1537#L76-2 [2021-10-11 00:33:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:03,650 INFO L82 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 5 times [2021-10-11 00:33:03,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:03,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190736451] [2021-10-11 00:33:03,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:03,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:03,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:03,683 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:03,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:03,684 INFO L82 PathProgramCache]: Analyzing trace with hash 983324395, now seen corresponding path program 1 times [2021-10-11 00:33:03,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:03,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724115659] [2021-10-11 00:33:03,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 00:33:03,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724115659] [2021-10-11 00:33:03,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:03,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:03,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883264462] [2021-10-11 00:33:03,703 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:03,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:03,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:03,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:03,704 INFO L87 Difference]: Start difference. First operand 134 states and 201 transitions. cyclomatic complexity: 69 Second operand 3 states. [2021-10-11 00:33:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:03,803 INFO L93 Difference]: Finished difference Result 162 states and 244 transitions. [2021-10-11 00:33:03,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:03,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 244 transitions. [2021-10-11 00:33:03,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 143 [2021-10-11 00:33:03,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 244 transitions. [2021-10-11 00:33:03,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2021-10-11 00:33:03,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2021-10-11 00:33:03,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 244 transitions. [2021-10-11 00:33:03,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:03,808 INFO L692 BuchiCegarLoop]: Abstraction has 162 states and 244 transitions. [2021-10-11 00:33:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 244 transitions. [2021-10-11 00:33:03,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2021-10-11 00:33:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2021-10-11 00:33:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 241 transitions. [2021-10-11 00:33:03,813 INFO L715 BuchiCegarLoop]: Abstraction has 159 states and 241 transitions. [2021-10-11 00:33:03,813 INFO L595 BuchiCegarLoop]: Abstraction has 159 states and 241 transitions. [2021-10-11 00:33:03,813 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-11 00:33:03,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 241 transitions. [2021-10-11 00:33:03,814 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 140 [2021-10-11 00:33:03,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:03,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:03,815 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:03,815 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:03,816 INFO L794 eck$LassoCheckResult]: Stem: 1789#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 1764#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1760#L51 assume !(0 == mp_add_~a3~0 % 256); 1757#L51-1 mp_add_~nb~0 := 4; 1758#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1765#L63 assume !(0 == mp_add_~b2~0 % 256); 1766#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1866#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1865#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1864#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1824#L76-2 [2021-10-11 00:33:03,816 INFO L796 eck$LassoCheckResult]: Loop: 1824#L76-2 assume !(1 == mp_add_~i~0 % 256); 1861#L77-1 assume !(2 == mp_add_~i~0 % 256); 1859#L78-1 assume !(3 == mp_add_~i~0 % 256); 1858#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1854#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1809#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1807#L91-1 assume !(1 == mp_add_~i~0 % 256); 1805#L92-1 assume !(2 == mp_add_~i~0 % 256); 1804#L93-1 assume !(3 == mp_add_~i~0 % 256); 1802#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1797#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1798#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1877#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1762#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1888#L87-1 assume !(0 == mp_add_~i~0 % 256); 1887#L91-1 assume !(1 == mp_add_~i~0 % 256); 1886#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 1755#L93-1 assume !(3 == mp_add_~i~0 % 256); 1756#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1779#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1780#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1790#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1824#L76-2 [2021-10-11 00:33:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:03,816 INFO L82 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 6 times [2021-10-11 00:33:03,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:03,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902994842] [2021-10-11 00:33:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:03,830 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:03,852 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:03,856 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:03,857 INFO L82 PathProgramCache]: Analyzing trace with hash 305113067, now seen corresponding path program 1 times [2021-10-11 00:33:03,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:03,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137221857] [2021-10-11 00:33:03,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-11 00:33:03,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137221857] [2021-10-11 00:33:03,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:03,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:03,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492620986] [2021-10-11 00:33:03,902 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:03,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:03,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:03,903 INFO L87 Difference]: Start difference. First operand 159 states and 241 transitions. cyclomatic complexity: 84 Second operand 4 states. [2021-10-11 00:33:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:04,118 INFO L93 Difference]: Finished difference Result 242 states and 364 transitions. [2021-10-11 00:33:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:04,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 364 transitions. [2021-10-11 00:33:04,121 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 223 [2021-10-11 00:33:04,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 242 states and 364 transitions. [2021-10-11 00:33:04,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 242 [2021-10-11 00:33:04,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2021-10-11 00:33:04,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 242 states and 364 transitions. [2021-10-11 00:33:04,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:04,125 INFO L692 BuchiCegarLoop]: Abstraction has 242 states and 364 transitions. [2021-10-11 00:33:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states and 364 transitions. [2021-10-11 00:33:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 192. [2021-10-11 00:33:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2021-10-11 00:33:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 292 transitions. [2021-10-11 00:33:04,130 INFO L715 BuchiCegarLoop]: Abstraction has 192 states and 292 transitions. [2021-10-11 00:33:04,130 INFO L595 BuchiCegarLoop]: Abstraction has 192 states and 292 transitions. [2021-10-11 00:33:04,130 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-11 00:33:04,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 292 transitions. [2021-10-11 00:33:04,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 173 [2021-10-11 00:33:04,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:04,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:04,132 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:04,133 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:04,133 INFO L794 eck$LassoCheckResult]: Stem: 2205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 2177#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 2176#L51 assume !(0 == mp_add_~a3~0 % 256); 2171#L51-1 mp_add_~nb~0 := 4; 2172#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 2178#L63 assume !(0 == mp_add_~b2~0 % 256); 2179#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2302#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2301#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2300#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2268#L76-2 [2021-10-11 00:33:04,133 INFO L796 eck$LassoCheckResult]: Loop: 2268#L76-2 assume !(1 == mp_add_~i~0 % 256); 2299#L77-1 assume !(2 == mp_add_~i~0 % 256); 2298#L78-1 assume !(3 == mp_add_~i~0 % 256); 2292#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2289#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2184#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2160#L91-1 assume !(1 == mp_add_~i~0 % 256); 2161#L92-1 assume !(2 == mp_add_~i~0 % 256); 2312#L93-1 assume !(3 == mp_add_~i~0 % 256); 2309#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2307#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2304#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 2190#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2175#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 2226#L87-1 assume !(0 == mp_add_~i~0 % 256); 2224#L91-1 assume !(1 == mp_add_~i~0 % 256); 2221#L92-1 assume !(2 == mp_add_~i~0 % 256); 2218#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 2215#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2213#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2214#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2267#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2268#L76-2 [2021-10-11 00:33:04,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:04,134 INFO L82 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 7 times [2021-10-11 00:33:04,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:04,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130415661] [2021-10-11 00:33:04,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:04,146 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:04,158 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:04,162 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:04,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:04,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1260239893, now seen corresponding path program 1 times [2021-10-11 00:33:04,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:04,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591138186] [2021-10-11 00:33:04,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 00:33:04,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591138186] [2021-10-11 00:33:04,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:04,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:04,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275841412] [2021-10-11 00:33:04,209 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:04,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:04,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:04,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:04,210 INFO L87 Difference]: Start difference. First operand 192 states and 292 transitions. cyclomatic complexity: 102 Second operand 4 states. [2021-10-11 00:33:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:04,437 INFO L93 Difference]: Finished difference Result 313 states and 485 transitions. [2021-10-11 00:33:04,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:04,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 485 transitions. [2021-10-11 00:33:04,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 284 [2021-10-11 00:33:04,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 313 states and 485 transitions. [2021-10-11 00:33:04,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 313 [2021-10-11 00:33:04,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 313 [2021-10-11 00:33:04,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 313 states and 485 transitions. [2021-10-11 00:33:04,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:04,446 INFO L692 BuchiCegarLoop]: Abstraction has 313 states and 485 transitions. [2021-10-11 00:33:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states and 485 transitions. [2021-10-11 00:33:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 216. [2021-10-11 00:33:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2021-10-11 00:33:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 337 transitions. [2021-10-11 00:33:04,452 INFO L715 BuchiCegarLoop]: Abstraction has 216 states and 337 transitions. [2021-10-11 00:33:04,452 INFO L595 BuchiCegarLoop]: Abstraction has 216 states and 337 transitions. [2021-10-11 00:33:04,452 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-11 00:33:04,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 216 states and 337 transitions. [2021-10-11 00:33:04,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 194 [2021-10-11 00:33:04,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:04,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:04,454 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:04,455 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:04,455 INFO L794 eck$LassoCheckResult]: Stem: 2718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 2690#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 2689#L51 assume !(0 == mp_add_~a3~0 % 256); 2685#L51-1 mp_add_~nb~0 := 4; 2686#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 2691#L63 assume !(0 == mp_add_~b2~0 % 256); 2692#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2856#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2855#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2854#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2805#L76-2 [2021-10-11 00:33:04,455 INFO L796 eck$LassoCheckResult]: Loop: 2805#L76-2 assume !(1 == mp_add_~i~0 % 256); 2852#L77-1 assume !(2 == mp_add_~i~0 % 256); 2849#L78-1 assume !(3 == mp_add_~i~0 % 256); 2844#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2843#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 2754#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2753#L91-1 assume !(1 == mp_add_~i~0 % 256); 2734#L92-1 assume !(2 == mp_add_~i~0 % 256); 2749#L93-1 assume !(3 == mp_add_~i~0 % 256); 2812#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2810#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2800#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 2799#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2740#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2816#L87-1 assume !(0 == mp_add_~i~0 % 256); 2815#L91-1 assume !(1 == mp_add_~i~0 % 256); 2814#L92-1 assume !(2 == mp_add_~i~0 % 256); 2813#L93-1 assume !(3 == mp_add_~i~0 % 256); 2804#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2802#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2803#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2861#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2805#L76-2 [2021-10-11 00:33:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 8 times [2021-10-11 00:33:04,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:04,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385566149] [2021-10-11 00:33:04,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:04,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:04,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:04,485 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:04,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:04,486 INFO L82 PathProgramCache]: Analyzing trace with hash 362371369, now seen corresponding path program 1 times [2021-10-11 00:33:04,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:04,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231826635] [2021-10-11 00:33:04,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:04,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231826635] [2021-10-11 00:33:04,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13651314] [2021-10-11 00:33:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:33:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:04,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 00:33:04,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:04,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:33:04,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-10-11 00:33:04,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972072399] [2021-10-11 00:33:04,778 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:04,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:04,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 00:33:04,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:33:04,779 INFO L87 Difference]: Start difference. First operand 216 states and 337 transitions. cyclomatic complexity: 123 Second operand 7 states. [2021-10-11 00:33:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:05,122 INFO L93 Difference]: Finished difference Result 307 states and 439 transitions. [2021-10-11 00:33:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:33:05,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 439 transitions. [2021-10-11 00:33:05,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 251 [2021-10-11 00:33:05,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 307 states and 439 transitions. [2021-10-11 00:33:05,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2021-10-11 00:33:05,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2021-10-11 00:33:05,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 439 transitions. [2021-10-11 00:33:05,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:05,130 INFO L692 BuchiCegarLoop]: Abstraction has 307 states and 439 transitions. [2021-10-11 00:33:05,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 439 transitions. [2021-10-11 00:33:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 236. [2021-10-11 00:33:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2021-10-11 00:33:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 361 transitions. [2021-10-11 00:33:05,136 INFO L715 BuchiCegarLoop]: Abstraction has 236 states and 361 transitions. [2021-10-11 00:33:05,137 INFO L595 BuchiCegarLoop]: Abstraction has 236 states and 361 transitions. [2021-10-11 00:33:05,137 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2021-10-11 00:33:05,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 236 states and 361 transitions. [2021-10-11 00:33:05,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 208 [2021-10-11 00:33:05,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:05,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:05,139 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:05,140 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:05,140 INFO L794 eck$LassoCheckResult]: Stem: 3309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 3288#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3287#L51 assume !(0 == mp_add_~a3~0 % 256); 3283#L51-1 mp_add_~nb~0 := 4; 3284#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 3289#L63 assume !(0 == mp_add_~b2~0 % 256); 3290#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3306#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3507#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3506#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3392#L76-2 [2021-10-11 00:33:05,140 INFO L796 eck$LassoCheckResult]: Loop: 3392#L76-2 assume !(1 == mp_add_~i~0 % 256); 3498#L77-1 assume !(2 == mp_add_~i~0 % 256); 3497#L78-1 assume !(3 == mp_add_~i~0 % 256); 3494#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3492#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3423#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3422#L91-1 assume !(1 == mp_add_~i~0 % 256); 3421#L92-1 assume !(2 == mp_add_~i~0 % 256); 3420#L93-1 assume !(3 == mp_add_~i~0 % 256); 3307#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3302#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3303#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 3509#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3304#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 3305#L87-1 assume !(0 == mp_add_~i~0 % 256); 3458#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 3335#L92-1 assume !(2 == mp_add_~i~0 % 256); 3425#L93-1 assume !(3 == mp_add_~i~0 % 256); 3337#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3338#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3481#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 3348#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3347#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3379#L87-1 assume !(0 == mp_add_~i~0 % 256); 3378#L91-1 assume !(1 == mp_add_~i~0 % 256); 3376#L92-1 assume !(2 == mp_add_~i~0 % 256); 3374#L93-1 assume !(3 == mp_add_~i~0 % 256); 3373#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3372#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3364#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3365#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3392#L76-2 [2021-10-11 00:33:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 9 times [2021-10-11 00:33:05,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:05,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497989848] [2021-10-11 00:33:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:05,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:05,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:05,168 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:05,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:05,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1448206814, now seen corresponding path program 2 times [2021-10-11 00:33:05,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:05,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687508856] [2021-10-11 00:33:05,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:05,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687508856] [2021-10-11 00:33:05,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213693063] [2021-10-11 00:33:05,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:33:05,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-11 00:33:05,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 00:33:05,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-11 00:33:05,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 00:33:05,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:33:05,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-10-11 00:33:05,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691958488] [2021-10-11 00:33:05,362 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:05,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:05,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 00:33:05,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:33:05,364 INFO L87 Difference]: Start difference. First operand 236 states and 361 transitions. cyclomatic complexity: 127 Second operand 8 states. [2021-10-11 00:33:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:06,316 INFO L93 Difference]: Finished difference Result 387 states and 534 transitions. [2021-10-11 00:33:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-11 00:33:06,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 534 transitions. [2021-10-11 00:33:06,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 353 [2021-10-11 00:33:06,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 387 states and 534 transitions. [2021-10-11 00:33:06,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 387 [2021-10-11 00:33:06,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2021-10-11 00:33:06,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 387 states and 534 transitions. [2021-10-11 00:33:06,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:06,326 INFO L692 BuchiCegarLoop]: Abstraction has 387 states and 534 transitions. [2021-10-11 00:33:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states and 534 transitions. [2021-10-11 00:33:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 221. [2021-10-11 00:33:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2021-10-11 00:33:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 324 transitions. [2021-10-11 00:33:06,335 INFO L715 BuchiCegarLoop]: Abstraction has 221 states and 324 transitions. [2021-10-11 00:33:06,335 INFO L595 BuchiCegarLoop]: Abstraction has 221 states and 324 transitions. [2021-10-11 00:33:06,335 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2021-10-11 00:33:06,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 324 transitions. [2021-10-11 00:33:06,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 193 [2021-10-11 00:33:06,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:06,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:06,338 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:06,338 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:06,338 INFO L794 eck$LassoCheckResult]: Stem: 4081#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 4057#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 4054#L51 assume !(0 == mp_add_~a3~0 % 256); 4051#L51-1 mp_add_~nb~0 := 4; 4052#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 4058#L63 assume !(0 == mp_add_~b2~0 % 256); 4059#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4076#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4204#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4205#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4176#L76-2 [2021-10-11 00:33:06,344 INFO L796 eck$LassoCheckResult]: Loop: 4176#L76-2 assume !(1 == mp_add_~i~0 % 256); 4241#L77-1 assume !(2 == mp_add_~i~0 % 256); 4240#L78-1 assume !(3 == mp_add_~i~0 % 256); 4237#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4235#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4232#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4231#L91-1 assume !(1 == mp_add_~i~0 % 256); 4230#L92-1 assume !(2 == mp_add_~i~0 % 256); 4212#L93-1 assume !(3 == mp_add_~i~0 % 256); 4213#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4071#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4072#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4259#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4075#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4063#L87-1 assume !(0 == mp_add_~i~0 % 256); 4064#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 4115#L92-1 assume !(2 == mp_add_~i~0 % 256); 4113#L93-1 assume !(3 == mp_add_~i~0 % 256); 4111#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4109#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4110#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4083#L76 assume !(0 == mp_add_~i~0 % 256); 4224#L76-2 assume !(1 == mp_add_~i~0 % 256); 4222#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 4221#L78-1 assume !(3 == mp_add_~i~0 % 256); 4219#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4216#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4215#L87-1 assume !(0 == mp_add_~i~0 % 256); 4214#L91-1 assume !(1 == mp_add_~i~0 % 256); 4208#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 4175#L93-1 assume !(3 == mp_add_~i~0 % 256); 4143#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4142#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4140#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4127#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4123#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4117#L87-1 assume !(0 == mp_add_~i~0 % 256); 4116#L91-1 assume !(1 == mp_add_~i~0 % 256); 4114#L92-1 assume !(2 == mp_add_~i~0 % 256); 4112#L93-1 assume !(3 == mp_add_~i~0 % 256); 4097#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4098#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4106#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4161#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4176#L76-2 [2021-10-11 00:33:06,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 10 times [2021-10-11 00:33:06,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:06,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498456570] [2021-10-11 00:33:06,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:06,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:06,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:06,390 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash 161682135, now seen corresponding path program 1 times [2021-10-11 00:33:06,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:06,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775626163] [2021-10-11 00:33:06,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-11 00:33:06,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775626163] [2021-10-11 00:33:06,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:06,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:33:06,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518773207] [2021-10-11 00:33:06,491 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:06,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:06,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:33:06,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:06,492 INFO L87 Difference]: Start difference. First operand 221 states and 324 transitions. cyclomatic complexity: 105 Second operand 6 states. [2021-10-11 00:33:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:06,922 INFO L93 Difference]: Finished difference Result 482 states and 695 transitions. [2021-10-11 00:33:06,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:33:06,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 695 transitions. [2021-10-11 00:33:06,927 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 424 [2021-10-11 00:33:06,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 479 states and 691 transitions. [2021-10-11 00:33:06,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 479 [2021-10-11 00:33:06,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 479 [2021-10-11 00:33:06,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 479 states and 691 transitions. [2021-10-11 00:33:06,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:06,934 INFO L692 BuchiCegarLoop]: Abstraction has 479 states and 691 transitions. [2021-10-11 00:33:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states and 691 transitions. [2021-10-11 00:33:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 396. [2021-10-11 00:33:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2021-10-11 00:33:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 588 transitions. [2021-10-11 00:33:06,943 INFO L715 BuchiCegarLoop]: Abstraction has 396 states and 588 transitions. [2021-10-11 00:33:06,943 INFO L595 BuchiCegarLoop]: Abstraction has 396 states and 588 transitions. [2021-10-11 00:33:06,943 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2021-10-11 00:33:06,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 588 transitions. [2021-10-11 00:33:06,946 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 368 [2021-10-11 00:33:06,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:06,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:06,947 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:06,947 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:06,947 INFO L794 eck$LassoCheckResult]: Stem: 4799#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 4778#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 4775#L51 assume !(0 == mp_add_~a3~0 % 256); 4772#L51-1 mp_add_~nb~0 := 4; 4773#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 4779#L63 assume !(0 == mp_add_~b2~0 % 256); 4780#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5089#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5088#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5087#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5052#L76-2 [2021-10-11 00:33:06,947 INFO L796 eck$LassoCheckResult]: Loop: 5052#L76-2 assume !(1 == mp_add_~i~0 % 256); 5086#L77-1 assume !(2 == mp_add_~i~0 % 256); 5085#L78-1 assume !(3 == mp_add_~i~0 % 256); 5082#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5080#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5078#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5077#L91-1 assume !(1 == mp_add_~i~0 % 256); 5075#L92-1 assume !(2 == mp_add_~i~0 % 256); 5073#L93-1 assume !(3 == mp_add_~i~0 % 256); 5072#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5070#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5071#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5064#L76 assume !(0 == mp_add_~i~0 % 256); 5063#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 4885#L77-1 assume !(2 == mp_add_~i~0 % 256); 5061#L78-1 assume !(3 == mp_add_~i~0 % 256); 5059#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5031#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5030#L87-1 assume !(0 == mp_add_~i~0 % 256); 4841#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 4823#L92-1 assume !(2 == mp_add_~i~0 % 256); 4837#L93-1 assume !(3 == mp_add_~i~0 % 256); 4838#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4827#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4828#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4785#L76 assume !(0 == mp_add_~i~0 % 256); 4782#L76-2 assume !(1 == mp_add_~i~0 % 256); 4783#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 4788#L78-1 assume !(3 == mp_add_~i~0 % 256); 4789#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5128#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5126#L87-1 assume !(0 == mp_add_~i~0 % 256); 5124#L91-1 assume !(1 == mp_add_~i~0 % 256); 5067#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 5056#L93-1 assume !(3 == mp_add_~i~0 % 256); 4892#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4890#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4888#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4889#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4871#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4988#L87-1 assume !(0 == mp_add_~i~0 % 256); 4982#L91-1 assume !(1 == mp_add_~i~0 % 256); 4820#L92-1 assume !(2 == mp_add_~i~0 % 256); 4817#L93-1 assume !(3 == mp_add_~i~0 % 256); 4819#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4813#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4814#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5053#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5052#L76-2 [2021-10-11 00:33:06,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:06,948 INFO L82 PathProgramCache]: Analyzing trace with hash -184863620, now seen corresponding path program 11 times [2021-10-11 00:33:06,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:06,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313268685] [2021-10-11 00:33:06,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:06,962 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:06,974 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:06,980 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash 956773639, now seen corresponding path program 1 times [2021-10-11 00:33:06,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:06,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493169698] [2021-10-11 00:33:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:07,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493169698] [2021-10-11 00:33:07,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958305938] [2021-10-11 00:33:07,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:33:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:07,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-11 00:33:07,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-11 00:33:07,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:33:07,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2021-10-11 00:33:07,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445632209] [2021-10-11 00:33:07,417 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:07,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:07,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-11 00:33:07,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-10-11 00:33:07,419 INFO L87 Difference]: Start difference. First operand 396 states and 588 transitions. cyclomatic complexity: 195 Second operand 13 states. [2021-10-11 00:33:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:08,499 INFO L93 Difference]: Finished difference Result 431 states and 510 transitions. [2021-10-11 00:33:08,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-11 00:33:08,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 510 transitions. [2021-10-11 00:33:08,504 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 283 [2021-10-11 00:33:08,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 431 states and 510 transitions. [2021-10-11 00:33:08,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 431 [2021-10-11 00:33:08,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 431 [2021-10-11 00:33:08,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 431 states and 510 transitions. [2021-10-11 00:33:08,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:08,510 INFO L692 BuchiCegarLoop]: Abstraction has 431 states and 510 transitions. [2021-10-11 00:33:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states and 510 transitions. [2021-10-11 00:33:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 253. [2021-10-11 00:33:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2021-10-11 00:33:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2021-10-11 00:33:08,517 INFO L715 BuchiCegarLoop]: Abstraction has 253 states and 309 transitions. [2021-10-11 00:33:08,517 INFO L595 BuchiCegarLoop]: Abstraction has 253 states and 309 transitions. [2021-10-11 00:33:08,517 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2021-10-11 00:33:08,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 253 states and 309 transitions. [2021-10-11 00:33:08,519 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 143 [2021-10-11 00:33:08,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:33:08,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:33:08,521 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:08,521 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1] [2021-10-11 00:33:08,521 INFO L794 eck$LassoCheckResult]: Stem: 5804#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 5780#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 5777#L51 assume !(0 == mp_add_~a3~0 % 256); 5774#L51-1 mp_add_~nb~0 := 4; 5775#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 5781#L63 assume !(0 == mp_add_~b2~0 % 256); 5782#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5849#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5847#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5845#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5843#L76-2 assume !(1 == mp_add_~i~0 % 256); 5842#L77-1 assume !(2 == mp_add_~i~0 % 256); 5840#L78-1 assume !(3 == mp_add_~i~0 % 256); 5837#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5834#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5833#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5832#L91-1 assume !(1 == mp_add_~i~0 % 256); 5831#L92-1 assume !(2 == mp_add_~i~0 % 256); 5830#L93-1 assume !(3 == mp_add_~i~0 % 256); 5829#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5827#L72-2 assume !((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536); 5826#L99-1 assume !!(mp_add_~i~0 % 256 < 4); 5825#L100 assume !(0 == mp_add_~i~0 % 256); 5824#L100-2 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := 0; 5823#L101-1 assume !(2 == mp_add_~i~0 % 256); 5822#L102-1 assume !(3 == mp_add_~i~0 % 256); 5817#L103-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5815#L99-1 assume !!(mp_add_~i~0 % 256 < 4); 5813#L100 assume !(0 == mp_add_~i~0 % 256); 5811#L100-2 assume !(1 == mp_add_~i~0 % 256); 5808#L101-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := 0; 5809#L102-1 [2021-10-11 00:33:08,521 INFO L796 eck$LassoCheckResult]: Loop: 5809#L102-1 assume !(3 == mp_add_~i~0 % 256); 5796#L103-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5797#L99-1 assume !!(mp_add_~i~0 % 256 < 4); 5793#L100 assume !(0 == mp_add_~i~0 % 256); 5789#L100-2 assume !(1 == mp_add_~i~0 % 256); 5790#L101-1 assume !(2 == mp_add_~i~0 % 256); 5768#L102-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := 0; 5769#L103-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5816#L99-1 assume !!(mp_add_~i~0 % 256 < 4); 5814#L100 assume !(0 == mp_add_~i~0 % 256); 5812#L100-2 assume !(1 == mp_add_~i~0 % 256); 5810#L101-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := 0; 5809#L102-1 [2021-10-11 00:33:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:08,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1979202376, now seen corresponding path program 1 times [2021-10-11 00:33:08,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:08,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115840217] [2021-10-11 00:33:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 00:33:08,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115840217] [2021-10-11 00:33:08,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735161187] [2021-10-11 00:33:08,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:33:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:08,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-11 00:33:08,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 00:33:08,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-11 00:33:08,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-10-11 00:33:08,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540312466] [2021-10-11 00:33:08,840 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:33:08,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:08,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1701860133, now seen corresponding path program 1 times [2021-10-11 00:33:08,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:08,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984561756] [2021-10-11 00:33:08,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:08,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984561756] [2021-10-11 00:33:08,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315392010] [2021-10-11 00:33:08,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8bb9371-11ee-4192-ae00-53c3457314f8/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:33:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:08,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-11 00:33:08,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:33:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:09,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:33:09,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2021-10-11 00:33:09,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4966663] [2021-10-11 00:33:09,035 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:33:09,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:09,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-11 00:33:09,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-11 00:33:09,036 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. cyclomatic complexity: 59 Second operand 10 states. [2021-10-11 00:33:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:09,659 INFO L93 Difference]: Finished difference Result 265 states and 299 transitions. [2021-10-11 00:33:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 00:33:09,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 299 transitions. [2021-10-11 00:33:09,662 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:33:09,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 0 states and 0 transitions. [2021-10-11 00:33:09,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-11 00:33:09,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-11 00:33:09,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-11 00:33:09,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:33:09,662 INFO L692 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:33:09,662 INFO L715 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:33:09,662 INFO L595 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:33:09,662 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2021-10-11 00:33:09,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-10-11 00:33:09,662 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:33:09,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-10-11 00:33:09,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 11.10 12:33:09 BoogieIcfgContainer [2021-10-11 00:33:09,667 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-11 00:33:09,668 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:33:09,668 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:33:09,668 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:33:09,669 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:00" (3/4) ... [2021-10-11 00:33:09,671 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-11 00:33:09,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:33:09,673 INFO L168 Benchmark]: Toolchain (without parser) took 10035.42 ms. Allocated memory was 92.3 MB in the beginning and 199.2 MB in the end (delta: 107.0 MB). Free memory was 52.0 MB in the beginning and 127.9 MB in the end (delta: -75.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:09,673 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 92.3 MB. Free memory is still 68.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:33:09,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.16 ms. Allocated memory is still 92.3 MB. Free memory was 51.8 MB in the beginning and 66.1 MB in the end (delta: -14.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:09,674 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.04 ms. Allocated memory is still 92.3 MB. Free memory was 66.1 MB in the beginning and 64.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:09,675 INFO L168 Benchmark]: Boogie Preprocessor took 30.66 ms. Allocated memory is still 92.3 MB. Free memory was 64.4 MB in the beginning and 63.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:09,675 INFO L168 Benchmark]: RCFGBuilder took 460.16 ms. Allocated memory is still 92.3 MB. Free memory was 63.0 MB in the beginning and 42.6 MB in the end (delta: 20.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:09,676 INFO L168 Benchmark]: BuchiAutomizer took 9186.85 ms. Allocated memory was 92.3 MB in the beginning and 199.2 MB in the end (delta: 107.0 MB). Free memory was 42.6 MB in the beginning and 129.0 MB in the end (delta: -86.3 MB). Peak memory consumption was 22.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:09,676 INFO L168 Benchmark]: Witness Printer took 3.67 ms. Allocated memory is still 199.2 MB. Free memory is still 127.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:33:09,678 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 92.3 MB. Free memory is still 68.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 310.16 ms. Allocated memory is still 92.3 MB. Free memory was 51.8 MB in the beginning and 66.1 MB in the end (delta: -14.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.04 ms. Allocated memory is still 92.3 MB. Free memory was 66.1 MB in the beginning and 64.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.66 ms. Allocated memory is still 92.3 MB. Free memory was 64.4 MB in the beginning and 63.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 460.16 ms. Allocated memory is still 92.3 MB. Free memory was 63.0 MB in the beginning and 42.6 MB in the end (delta: 20.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 9186.85 ms. Allocated memory was 92.3 MB in the beginning and 199.2 MB in the end (delta: 107.0 MB). Free memory was 42.6 MB in the beginning and 129.0 MB in the end (delta: -86.3 MB). Peak memory consumption was 22.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.67 ms. Allocated memory is still 199.2 MB. Free memory is still 127.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (15 trivial, 0 deterministic, 0 nondeterministic). 15 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 16 iterations. TraceHistogramMax:4. Analysis of lassos took 3.3s. Construction of modules took 3.5s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 0. Minimization of det autom 15. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 864 StatesRemovedByMinimization, 13 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 396 states and ocurred in iteration 13. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 539 SDtfs, 1672 SDslu, 668 SDs, 0 SdLazy, 3484 SolverSat, 301 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time LassoAnalysisResults: nont0 unkn0 SFLI12 SFLT0 conc0 concLT0 SILN0 SILU0 SILI3 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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...