./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/byte_add-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:06:07,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:06:07,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:06:07,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:06:07,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:06:07,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:06:07,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:06:07,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:06:07,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:06:07,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:06:07,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:06:07,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:06:07,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:06:07,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:06:07,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:06:07,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:06:07,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:06:07,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:06:07,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:06:07,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:06:07,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:06:07,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:06:07,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:06:07,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:06:07,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:06:07,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:06:07,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:06:07,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:06:07,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:06:07,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:06:07,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:06:07,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:06:07,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:06:07,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:06:07,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:06:07,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:06:07,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:06:07,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:06:07,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:06:07,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:06:07,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:06:07,148 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:06:07,175 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:06:07,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:06:07,176 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:06:07,176 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:06:07,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:06:07,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:06:07,177 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:06:07,178 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:06:07,178 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:06:07,178 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:06:07,179 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:06:07,179 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:06:07,179 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:06:07,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:06:07,179 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:06:07,179 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:06:07,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:06:07,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:06:07,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:06:07,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:06:07,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:06:07,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:06:07,180 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:06:07,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:06:07,182 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:06:07,182 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:06:07,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:06:07,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:06:07,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:06:07,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:06:07,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:06:07,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:06:07,184 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:06:07,184 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 [2021-12-15 17:06:07,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:06:07,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:06:07,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:06:07,402 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:06:07,402 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:06:07,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-1.i [2021-12-15 17:06:07,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e170b6f/40f323d353444e1daeda4491f0baf794/FLAG33917b975 [2021-12-15 17:06:08,100 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:06:08,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2021-12-15 17:06:08,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e170b6f/40f323d353444e1daeda4491f0baf794/FLAG33917b975 [2021-12-15 17:06:08,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e170b6f/40f323d353444e1daeda4491f0baf794 [2021-12-15 17:06:08,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:06:08,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:06:08,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:08,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:06:08,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:06:08,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:08" (1/1) ... [2021-12-15 17:06:08,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f739c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08, skipping insertion in model container [2021-12-15 17:06:08,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:08" (1/1) ... [2021-12-15 17:06:08,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:06:08,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:06:08,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i[1166,1179] [2021-12-15 17:06:08,735 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:08,741 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:06:08,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i[1166,1179] [2021-12-15 17:06:08,763 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:08,772 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:06:08,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08 WrapperNode [2021-12-15 17:06:08,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:08,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:08,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:06:08,774 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:06:08,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08" (1/1) ... [2021-12-15 17:06:08,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08" (1/1) ... [2021-12-15 17:06:08,813 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2021-12-15 17:06:08,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:08,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:06:08,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:06:08,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:06:08,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08" (1/1) ... [2021-12-15 17:06:08,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08" (1/1) ... [2021-12-15 17:06:08,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08" (1/1) ... [2021-12-15 17:06:08,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08" (1/1) ... [2021-12-15 17:06:08,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08" (1/1) ... [2021-12-15 17:06:08,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08" (1/1) ... [2021-12-15 17:06:08,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08" (1/1) ... [2021-12-15 17:06:08,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:06:08,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:06:08,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:06:08,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:06:08,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08" (1/1) ... [2021-12-15 17:06:08,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:08,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:08,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:06:08,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:06:08,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:06:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:06:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:06:08,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:06:08,996 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:06:08,998 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:06:09,228 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:06:09,234 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:06:09,235 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 17:06:09,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:09 BoogieIcfgContainer [2021-12-15 17:06:09,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:06:09,237 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:06:09,238 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:06:09,241 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:06:09,241 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:09,242 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:06:08" (1/3) ... [2021-12-15 17:06:09,243 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@252026f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:09, skipping insertion in model container [2021-12-15 17:06:09,243 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:09,243 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:08" (2/3) ... [2021-12-15 17:06:09,244 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@252026f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:09, skipping insertion in model container [2021-12-15 17:06:09,244 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:09,244 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:09" (3/3) ... [2021-12-15 17:06:09,245 INFO L388 chiAutomizerObserver]: Analyzing ICFG byte_add-1.i [2021-12-15 17:06:09,290 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:06:09,290 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:06:09,291 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:06:09,291 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:06:09,291 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:06:09,291 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:06:09,291 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:06:09,291 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:06:09,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:09,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-12-15 17:06:09,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:09,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:09,327 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:06:09,327 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:09,327 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:06:09,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:09,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-12-15 17:06:09,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:09,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:09,334 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:06:09,334 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:09,339 INFO L791 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 5#L59true assume !(0 == mp_add_~a3~0#1 % 256); 17#L59-1true mp_add_~nb~0#1 := 4; 19#L69true assume !(0 == mp_add_~b3~0#1 % 256); 36#L69-1true mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 24#L80-2true [2021-12-15 17:06:09,340 INFO L793 eck$LassoCheckResult]: Loop: 24#L80-2true assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33#L83true assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 42#L83-1true assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8#L89true assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 40#L95-1true assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 18#L99-1true assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 12#L100-1true assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 28#L101-1true assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 31#L102-1true mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 24#L80-2true [2021-12-15 17:06:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2021-12-15 17:06:09,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:09,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697362744] [2021-12-15 17:06:09,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:09,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:09,465 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:09,515 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:09,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash 318197182, now seen corresponding path program 1 times [2021-12-15 17:06:09,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:09,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335527292] [2021-12-15 17:06:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:09,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:09,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:09,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335527292] [2021-12-15 17:06:09,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335527292] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:09,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:09,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:09,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418804463] [2021-12-15 17:06:09,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:09,635 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:09,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:09,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:09,665 INFO L87 Difference]: Start difference. First operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:09,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:09,790 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2021-12-15 17:06:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:09,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 94 transitions. [2021-12-15 17:06:09,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2021-12-15 17:06:09,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 56 states and 86 transitions. [2021-12-15 17:06:09,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-12-15 17:06:09,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-12-15 17:06:09,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 86 transitions. [2021-12-15 17:06:09,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:09,811 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 86 transitions. [2021-12-15 17:06:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 86 transitions. [2021-12-15 17:06:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2021-12-15 17:06:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 53 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 84 transitions. [2021-12-15 17:06:09,844 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-12-15 17:06:09,855 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-12-15 17:06:09,855 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:06:09,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 84 transitions. [2021-12-15 17:06:09,856 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-15 17:06:09,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:09,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:09,857 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:09,857 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:09,857 INFO L791 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 127#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 114#L59 assume !(0 == mp_add_~a3~0#1 % 256); 115#L59-1 mp_add_~nb~0#1 := 4; 132#L69 assume !(0 == mp_add_~b3~0#1 % 256); 123#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 138#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 139#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 129#L83-1 [2021-12-15 17:06:09,857 INFO L793 eck$LassoCheckResult]: Loop: 129#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 118#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 119#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 133#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 125#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 126#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 144#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 147#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 159#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 160#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 135#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 141#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 128#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 129#L83-1 [2021-12-15 17:06:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:09,858 INFO L85 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2021-12-15 17:06:09,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:09,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130824696] [2021-12-15 17:06:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:09,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:09,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:09,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130824696] [2021-12-15 17:06:09,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130824696] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:09,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:09,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:06:09,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26503146] [2021-12-15 17:06:09,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:09,997 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:06:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 1 times [2021-12-15 17:06:09,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:09,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292080861] [2021-12-15 17:06:09,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:09,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:10,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:10,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292080861] [2021-12-15 17:06:10,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292080861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:10,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:10,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:06:10,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828821382] [2021-12-15 17:06:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:10,067 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:10,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:10,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:06:10,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:06:10,068 INFO L87 Difference]: Start difference. First operand 54 states and 84 transitions. cyclomatic complexity: 32 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:10,278 INFO L93 Difference]: Finished difference Result 149 states and 228 transitions. [2021-12-15 17:06:10,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:06:10,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 228 transitions. [2021-12-15 17:06:10,280 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2021-12-15 17:06:10,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 228 transitions. [2021-12-15 17:06:10,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2021-12-15 17:06:10,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2021-12-15 17:06:10,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 228 transitions. [2021-12-15 17:06:10,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:10,283 INFO L681 BuchiCegarLoop]: Abstraction has 149 states and 228 transitions. [2021-12-15 17:06:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 228 transitions. [2021-12-15 17:06:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 78. [2021-12-15 17:06:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2021-12-15 17:06:10,288 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-12-15 17:06:10,288 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-12-15 17:06:10,288 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:06:10,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 113 transitions. [2021-12-15 17:06:10,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-15 17:06:10,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:10,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:10,290 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:10,290 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:10,290 INFO L791 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 333#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 335#L61 assume !(0 == mp_add_~a2~0#1 % 256); 336#L59-1 mp_add_~nb~0#1 := 4; 350#L69 assume !(0 == mp_add_~b3~0#1 % 256); 341#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 380#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 381#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 402#L83-1 [2021-12-15 17:06:10,290 INFO L793 eck$LassoCheckResult]: Loop: 402#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 404#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 372#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 373#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 403#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 362#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 363#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 364#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 378#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 368#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 352#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 357#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 358#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 402#L83-1 [2021-12-15 17:06:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:10,291 INFO L85 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2021-12-15 17:06:10,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:10,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904113406] [2021-12-15 17:06:10,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:10,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:10,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:10,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904113406] [2021-12-15 17:06:10,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904113406] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:10,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:10,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:06:10,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3520065] [2021-12-15 17:06:10,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:10,353 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:06:10,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 2 times [2021-12-15 17:06:10,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:10,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381120870] [2021-12-15 17:06:10,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:10,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:10,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:10,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381120870] [2021-12-15 17:06:10,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381120870] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:10,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:10,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:06:10,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007337308] [2021-12-15 17:06:10,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:10,400 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:10,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:10,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 17:06:10,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-15 17:06:10,401 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. cyclomatic complexity: 37 Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:10,817 INFO L93 Difference]: Finished difference Result 226 states and 344 transitions. [2021-12-15 17:06:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 17:06:10,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 344 transitions. [2021-12-15 17:06:10,820 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 161 [2021-12-15 17:06:10,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 226 states and 344 transitions. [2021-12-15 17:06:10,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226 [2021-12-15 17:06:10,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2021-12-15 17:06:10,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 344 transitions. [2021-12-15 17:06:10,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:10,823 INFO L681 BuchiCegarLoop]: Abstraction has 226 states and 344 transitions. [2021-12-15 17:06:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 344 transitions. [2021-12-15 17:06:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 78. [2021-12-15 17:06:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2021-12-15 17:06:10,827 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-12-15 17:06:10,827 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-12-15 17:06:10,827 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:06:10,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 113 transitions. [2021-12-15 17:06:10,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-15 17:06:10,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:10,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:10,829 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:10,829 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:10,829 INFO L791 eck$LassoCheckResult]: Stem: 676#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 655#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 657#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 658#L63 assume !(0 == mp_add_~a1~0#1 % 256); 659#L59-1 mp_add_~nb~0#1 := 4; 703#L69 assume !(0 == mp_add_~b3~0#1 % 256); 699#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 700#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 705#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 693#L83-1 [2021-12-15 17:06:10,829 INFO L793 eck$LassoCheckResult]: Loop: 693#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 653#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 654#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 692#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 660#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 661#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 683#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 695#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 696#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 689#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 674#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 679#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 680#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 693#L83-1 [2021-12-15 17:06:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2089936051, now seen corresponding path program 1 times [2021-12-15 17:06:10,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:10,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274753655] [2021-12-15 17:06:10,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:10,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:10,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:10,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274753655] [2021-12-15 17:06:10,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274753655] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:10,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:10,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 17:06:10,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484608548] [2021-12-15 17:06:10,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:10,987 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:06:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:10,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 3 times [2021-12-15 17:06:10,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:10,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923496905] [2021-12-15 17:06:10,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:10,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:11,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:11,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923496905] [2021-12-15 17:06:11,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923496905] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:11,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:11,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:06:11,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388869931] [2021-12-15 17:06:11,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:11,019 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:11,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:11,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 17:06:11,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 17:06:11,020 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. cyclomatic complexity: 37 Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:11,765 INFO L93 Difference]: Finished difference Result 376 states and 549 transitions. [2021-12-15 17:06:11,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 17:06:11,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 376 states and 549 transitions. [2021-12-15 17:06:11,769 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 267 [2021-12-15 17:06:11,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 376 states to 376 states and 549 transitions. [2021-12-15 17:06:11,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2021-12-15 17:06:11,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 376 [2021-12-15 17:06:11,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 376 states and 549 transitions. [2021-12-15 17:06:11,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:11,772 INFO L681 BuchiCegarLoop]: Abstraction has 376 states and 549 transitions. [2021-12-15 17:06:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states and 549 transitions. [2021-12-15 17:06:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 222. [2021-12-15 17:06:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 222 states have (on average 1.454954954954955) internal successors, (323), 221 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2021-12-15 17:06:11,783 INFO L704 BuchiCegarLoop]: Abstraction has 222 states and 323 transitions. [2021-12-15 17:06:11,784 INFO L587 BuchiCegarLoop]: Abstraction has 222 states and 323 transitions. [2021-12-15 17:06:11,784 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:06:11,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 222 states and 323 transitions. [2021-12-15 17:06:11,785 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 135 [2021-12-15 17:06:11,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:11,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:11,786 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:11,786 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:11,786 INFO L791 eck$LassoCheckResult]: Stem: 1164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 1152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1140#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1142#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1144#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1145#L59-1 mp_add_~nb~0#1 := 4; 1189#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1185#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1186#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1286#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1330#L83-1 [2021-12-15 17:06:11,786 INFO L793 eck$LassoCheckResult]: Loop: 1330#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1312#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1297#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1296#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1295#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1294#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1291#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1288#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1289#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1177#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1336#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1335#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1333#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1330#L83-1 [2021-12-15 17:06:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:11,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194353, now seen corresponding path program 1 times [2021-12-15 17:06:11,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:11,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289462517] [2021-12-15 17:06:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:11,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:11,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:11,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289462517] [2021-12-15 17:06:11,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289462517] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:11,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:11,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 17:06:11,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009924322] [2021-12-15 17:06:11,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:11,861 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:06:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 4 times [2021-12-15 17:06:11,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:11,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019984271] [2021-12-15 17:06:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:11,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:11,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:11,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019984271] [2021-12-15 17:06:11,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019984271] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:11,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:11,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:06:11,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245027558] [2021-12-15 17:06:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:11,892 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:11,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:11,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 17:06:11,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 17:06:11,893 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. cyclomatic complexity: 107 Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:12,589 INFO L93 Difference]: Finished difference Result 287 states and 416 transitions. [2021-12-15 17:06:12,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 17:06:12,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 416 transitions. [2021-12-15 17:06:12,591 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 188 [2021-12-15 17:06:12,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 287 states and 416 transitions. [2021-12-15 17:06:12,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 287 [2021-12-15 17:06:12,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 287 [2021-12-15 17:06:12,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 416 transitions. [2021-12-15 17:06:12,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:12,594 INFO L681 BuchiCegarLoop]: Abstraction has 287 states and 416 transitions. [2021-12-15 17:06:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 416 transitions. [2021-12-15 17:06:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 246. [2021-12-15 17:06:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 245 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:06:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 359 transitions. [2021-12-15 17:06:12,610 INFO L704 BuchiCegarLoop]: Abstraction has 246 states and 359 transitions. [2021-12-15 17:06:12,610 INFO L587 BuchiCegarLoop]: Abstraction has 246 states and 359 transitions. [2021-12-15 17:06:12,610 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:06:12,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 359 transitions. [2021-12-15 17:06:12,612 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 162 [2021-12-15 17:06:12,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:12,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:12,613 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:12,613 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:06:12,613 INFO L791 eck$LassoCheckResult]: Stem: 1701#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 1690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1678#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1680#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1682#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1683#L59-1 mp_add_~nb~0#1 := 4; 1695#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1716#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1703#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1704#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1698#L84 [2021-12-15 17:06:12,614 INFO L793 eck$LassoCheckResult]: Loop: 1698#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1699#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1715#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1912#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1910#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1908#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1906#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1896#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1903#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1892#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1890#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1721#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1722#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1698#L84 [2021-12-15 17:06:12,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:12,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 1 times [2021-12-15 17:06:12,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:12,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582987949] [2021-12-15 17:06:12,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:12,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:12,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:12,664 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:12,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:12,666 INFO L85 PathProgramCache]: Analyzing trace with hash -135428754, now seen corresponding path program 5 times [2021-12-15 17:06:12,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:12,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234873058] [2021-12-15 17:06:12,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:12,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:12,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:12,684 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:12,685 INFO L85 PathProgramCache]: Analyzing trace with hash -578820102, now seen corresponding path program 1 times [2021-12-15 17:06:12,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:12,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125002323] [2021-12-15 17:06:12,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:12,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:12,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:12,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125002323] [2021-12-15 17:06:12,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125002323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:12,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:12,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:06:12,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667177213] [2021-12-15 17:06:12,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:12,866 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:834) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:06:12,869 INFO L158 Benchmark]: Toolchain (without parser) took 4356.26ms. Allocated memory was 119.5MB in the beginning and 148.9MB in the end (delta: 29.4MB). Free memory was 87.5MB in the beginning and 98.0MB in the end (delta: -10.5MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2021-12-15 17:06:12,870 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:06:12,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.64ms. Allocated memory is still 119.5MB. Free memory was 87.5MB in the beginning and 93.5MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:06:12,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.44ms. Allocated memory is still 119.5MB. Free memory was 92.9MB in the beginning and 91.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:06:12,871 INFO L158 Benchmark]: Boogie Preprocessor took 31.37ms. Allocated memory is still 119.5MB. Free memory was 91.4MB in the beginning and 90.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:06:12,871 INFO L158 Benchmark]: RCFGBuilder took 390.20ms. Allocated memory is still 119.5MB. Free memory was 90.1MB in the beginning and 76.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 17:06:12,872 INFO L158 Benchmark]: BuchiAutomizer took 3630.90ms. Allocated memory was 119.5MB in the beginning and 148.9MB in the end (delta: 29.4MB). Free memory was 76.7MB in the beginning and 98.0MB in the end (delta: -21.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2021-12-15 17:06:12,874 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.18ms. Allocated memory is still 83.9MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.64ms. Allocated memory is still 119.5MB. Free memory was 87.5MB in the beginning and 93.5MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.44ms. Allocated memory is still 119.5MB. Free memory was 92.9MB in the beginning and 91.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.37ms. Allocated memory is still 119.5MB. Free memory was 91.4MB in the beginning and 90.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.20ms. Allocated memory is still 119.5MB. Free memory was 90.1MB in the beginning and 76.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3630.90ms. Allocated memory was 119.5MB in the beginning and 148.9MB in the end (delta: 29.4MB). Free memory was 76.7MB in the beginning and 98.0MB in the end (delta: -21.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:06:12,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable