./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash b9049196bba7cbcb7cf3ded9c8379f49dc6ac79e222934a18b33266f1e0c667f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:30:45,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:30:45,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:30:45,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:30:45,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:30:45,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:30:45,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:30:45,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:30:45,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:30:45,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:30:45,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:30:45,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:30:45,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:30:45,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:30:45,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:30:45,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:30:45,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:30:45,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:30:45,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:30:45,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:30:45,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:30:45,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:30:45,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:30:45,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:30:45,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:30:45,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:30:45,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:30:45,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:30:45,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:30:45,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:30:45,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:30:45,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:30:45,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:30:45,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:30:45,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:30:45,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:30:45,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:30:45,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:30:45,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:30:45,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:30:45,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:30:45,530 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:30:45,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:30:45,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:30:45,553 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:30:45,553 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:30:45,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:30:45,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:30:45,554 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:30:45,554 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:30:45,554 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:30:45,555 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:30:45,567 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:30:45,567 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:30:45,567 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:30:45,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:30:45,567 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:30:45,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:30:45,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:30:45,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:30:45,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:30:45,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:30:45,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:30:45,568 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:30:45,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:30:45,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:30:45,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:30:45,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:30:45,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:30:45,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:30:45,569 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:30:45,569 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9049196bba7cbcb7cf3ded9c8379f49dc6ac79e222934a18b33266f1e0c667f [2022-02-21 03:30:45,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:30:45,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:30:45,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:30:45,832 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:30:45,832 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:30:45,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2022-02-21 03:30:45,900 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a265292a6/26dcc353c0884afd9bd6dbc23ebd5459/FLAGe0070fa95 [2022-02-21 03:30:46,454 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:30:46,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2022-02-21 03:30:46,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a265292a6/26dcc353c0884afd9bd6dbc23ebd5459/FLAGe0070fa95 [2022-02-21 03:30:46,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a265292a6/26dcc353c0884afd9bd6dbc23ebd5459 [2022-02-21 03:30:46,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:30:46,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:30:46,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:30:46,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:30:46,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:30:46,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:30:46" (1/1) ... [2022-02-21 03:30:46,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bec8d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:46, skipping insertion in model container [2022-02-21 03:30:46,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:30:46" (1/1) ... [2022-02-21 03:30:46,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:30:47,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:30:47,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:30:47,451 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:30:47,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:30:47,528 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:30:47,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:47 WrapperNode [2022-02-21 03:30:47,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:30:47,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:30:47,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:30:47,532 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:30:47,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:47" (1/1) ... [2022-02-21 03:30:47,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:47" (1/1) ... [2022-02-21 03:30:47,579 INFO L137 Inliner]: procedures = 110, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2022-02-21 03:30:47,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:30:47,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:30:47,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:30:47,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:30:47,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:47" (1/1) ... [2022-02-21 03:30:47,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:47" (1/1) ... [2022-02-21 03:30:47,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:47" (1/1) ... [2022-02-21 03:30:47,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:47" (1/1) ... [2022-02-21 03:30:47,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:47" (1/1) ... [2022-02-21 03:30:47,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:47" (1/1) ... [2022-02-21 03:30:47,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:47" (1/1) ... [2022-02-21 03:30:47,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:30:47,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:30:47,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:30:47,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:30:47,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:47" (1/1) ... [2022-02-21 03:30:47,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:47,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:47,667 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) [2022-02-21 03:30:47,691 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 [2022-02-21 03:30:47,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:30:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:30:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:30:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:30:47,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:30:47,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:30:47,835 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:30:47,836 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:30:48,034 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:30:48,039 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:30:48,042 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:30:48,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:48 BoogieIcfgContainer [2022-02-21 03:30:48,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:30:48,045 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:30:48,045 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:30:48,048 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:30:48,048 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:48,049 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:30:46" (1/3) ... [2022-02-21 03:30:48,049 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1741a08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:30:48, skipping insertion in model container [2022-02-21 03:30:48,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:48,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:47" (2/3) ... [2022-02-21 03:30:48,050 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1741a08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:30:48, skipping insertion in model container [2022-02-21 03:30:48,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:48,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:48" (3/3) ... [2022-02-21 03:30:48,051 INFO L388 chiAutomizerObserver]: Analyzing ICFG KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i [2022-02-21 03:30:48,091 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:30:48,091 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:30:48,091 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:30:48,092 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:30:48,092 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:30:48,092 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:30:48,092 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:30:48,092 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:30:48,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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) [2022-02-21 03:30:48,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:48,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:48,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:48,130 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:30:48,130 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:30:48,130 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:30:48,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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) [2022-02-21 03:30:48,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:48,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:48,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:48,136 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:30:48,136 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:30:48,141 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem5#1, main_~x~0#1.base, main_~x~0#1.offset, main_~debug~0#1.base, main_~debug~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~debug~0#1.base, main_~debug~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(0, main_~debug~0#1.base, main_~debug~0#1.offset, 4); 9#L558-2true [2022-02-21 03:30:48,142 INFO L793 eck$LassoCheckResult]: Loop: 9#L558-2true call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 12#L552-1true assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 4#L553true assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1; 8#L553-2true call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); 7#L558true assume 0 != main_#t~mem10#1;havoc main_#t~mem10#1;call write~int(0, main_~x~0#1.base, main_~x~0#1.offset, 4); 9#L558-2true [2022-02-21 03:30:48,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:48,146 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:30:48,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:48,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747823191] [2022-02-21 03:30:48,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:48,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:48,283 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:48,331 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash 35468238, now seen corresponding path program 1 times [2022-02-21 03:30:48,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:48,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592925882] [2022-02-21 03:30:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:48,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:48,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:48,419 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:48,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907724, now seen corresponding path program 1 times [2022-02-21 03:30:48,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:48,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186143236] [2022-02-21 03:30:48,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:48,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:48,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {19#true} is VALID [2022-02-21 03:30:48,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem5#1, main_~x~0#1.base, main_~x~0#1.offset, main_~debug~0#1.base, main_~debug~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~debug~0#1.base, main_~debug~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(0, main_~debug~0#1.base, main_~debug~0#1.offset, 4); {21#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~debug~0#1.base|) |ULTIMATE.start_main_~debug~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~debug~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-21 03:30:48,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~debug~0#1.base|) |ULTIMATE.start_main_~debug~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~debug~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {21#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~debug~0#1.base|) |ULTIMATE.start_main_~debug~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~debug~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-21 03:30:48,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {21#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~debug~0#1.base|) |ULTIMATE.start_main_~debug~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~debug~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {21#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~debug~0#1.base|) |ULTIMATE.start_main_~debug~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~debug~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-21 03:30:48,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~debug~0#1.base|) |ULTIMATE.start_main_~debug~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~debug~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1; {21#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~debug~0#1.base|) |ULTIMATE.start_main_~debug~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~debug~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-21 03:30:48,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~debug~0#1.base|) |ULTIMATE.start_main_~debug~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~debug~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); {22#(= |ULTIMATE.start_main_#t~mem10#1| 0)} is VALID [2022-02-21 03:30:48,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#(= |ULTIMATE.start_main_#t~mem10#1| 0)} assume 0 != main_#t~mem10#1;havoc main_#t~mem10#1;call write~int(0, main_~x~0#1.base, main_~x~0#1.offset, 4); {20#false} is VALID [2022-02-21 03:30:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:30:48,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:30:48,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186143236] [2022-02-21 03:30:48,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186143236] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:30:48,593 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:30:48,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:30:48,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877043330] [2022-02-21 03:30:48,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:30:48,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:30:48,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:30:48,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:30:48,767 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-02-21 03:30:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:48,821 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:30:48,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:30:48,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-02-21 03:30:48,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:48,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2022-02-21 03:30:48,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:48,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2022-02-21 03:30:48,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:30:48,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:30:48,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2022-02-21 03:30:48,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:30:48,854 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:30:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2022-02-21 03:30:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-02-21 03:30:48,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:48,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2022-02-21 03:30:48,887 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2022-02-21 03:30:48,888 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2022-02-21 03:30:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:48,889 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2022-02-21 03:30:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:30:48,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:48,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:48,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) Second operand 7 states and 8 transitions. [2022-02-21 03:30:48,891 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) Second operand 7 states and 8 transitions. [2022-02-21 03:30:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:48,892 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2022-02-21 03:30:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:30:48,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:48,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:48,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:48,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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) [2022-02-21 03:30:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-02-21 03:30:48,896 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:30:48,896 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:30:48,896 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:30:48,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:30:48,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:48,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:48,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:48,897 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:30:48,897 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:30:48,898 INFO L791 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 39#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem5#1, main_~x~0#1.base, main_~x~0#1.offset, main_~debug~0#1.base, main_~debug~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~debug~0#1.base, main_~debug~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(0, main_~debug~0#1.base, main_~debug~0#1.offset, 4); 41#L558-2 [2022-02-21 03:30:48,898 INFO L793 eck$LassoCheckResult]: Loop: 41#L558-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 42#L552-1 assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 36#L553 assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1; 37#L553-2 call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); 40#L558 assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1; 41#L558-2 [2022-02-21 03:30:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:48,899 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:30:48,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:48,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320637506] [2022-02-21 03:30:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:48,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:48,918 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:48,932 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:48,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash 35468240, now seen corresponding path program 1 times [2022-02-21 03:30:48,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:48,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651270446] [2022-02-21 03:30:48,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:48,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:48,950 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:48,981 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:48,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:48,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907726, now seen corresponding path program 1 times [2022-02-21 03:30:48,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:48,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027250791] [2022-02-21 03:30:48,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:48,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:49,020 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:49,035 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:49,417 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:49,418 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:49,418 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:49,418 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:49,418 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:49,419 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,419 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:49,419 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:49,419 INFO L133 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i_Iteration2_Lasso [2022-02-21 03:30:49,419 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:49,419 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:49,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,725 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:30:49,727 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:30:49,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:49,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:50,232 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:50,235 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:50,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:50,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:50,252 INFO L229 MonitoredProcess]: Starting monitored process 2 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) [2022-02-21 03:30:50,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:50,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:50,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:50,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:50,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:50,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:50,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:50,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:50,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:50,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:30:50,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:30:50,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:50,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:50,299 INFO L229 MonitoredProcess]: Starting monitored process 3 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) [2022-02-21 03:30:50,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:30:50,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:50,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:50,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:50,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:50,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:50,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:50,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:50,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:50,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:50,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:50,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:50,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:50,352 INFO L229 MonitoredProcess]: Starting monitored process 4 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) [2022-02-21 03:30:50,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:50,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:30:50,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:50,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:50,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:50,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:50,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:50,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:50,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:50,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:50,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:50,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:50,411 INFO L229 MonitoredProcess]: Starting monitored process 5 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) [2022-02-21 03:30:50,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:30:50,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:50,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:50,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:50,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:50,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:50,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:50,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:50,435 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:50,455 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:30:50,456 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:30:50,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:50,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:50,459 INFO L229 MonitoredProcess]: Starting monitored process 6 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) [2022-02-21 03:30:50,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:30:50,461 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:50,479 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:30:50,479 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:50,480 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1 + 255 Supporting invariants [] [2022-02-21 03:30:50,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:30:50,536 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:30:50,540 INFO L390 LassoCheck]: Loop: "call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;" "call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4);" "assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1;" [2022-02-21 03:30:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:50,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:50,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:50,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {66#unseeded} is VALID [2022-02-21 03:30:50,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem5#1, main_~x~0#1.base, main_~x~0#1.offset, main_~debug~0#1.base, main_~debug~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~debug~0#1.base, main_~debug~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(0, main_~debug~0#1.base, main_~debug~0#1.offset, 4); {66#unseeded} is VALID [2022-02-21 03:30:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:50,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:30:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:50,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:50,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-02-21 03:30:50,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#(>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {142#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1|) (>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))))} is VALID [2022-02-21 03:30:50,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1|) (>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))))} assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {146#(and (< (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 255) (>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))))} is VALID [2022-02-21 03:30:50,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#(and (< (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 255) (>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))))} assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1; {150#(and (< 0 oldRank0) (<= 257 (+ oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:50,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {150#(and (< 0 oldRank0) (<= 257 (+ oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); {150#(and (< 0 oldRank0) (<= 257 (+ oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:50,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {150#(and (< 0 oldRank0) (<= 257 (+ oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1; {134#(or (and (>= oldRank0 0) (> oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))) unseeded)} is VALID [2022-02-21 03:30:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:30:50,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-02-21 03:30:50,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:50,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:50,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,917 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:30:50,918 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-02-21 03:30:51,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:51,047 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 21 transitions. Complement of second has 9 states. [2022-02-21 03:30:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:51,048 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:51,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:51,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:51,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:51,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-02-21 03:30:51,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:51,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:51,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:51,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:30:51,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:51,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:51,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:51,058 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:30:51,059 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:51,060 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-02-21 03:30:51,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:51,061 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:51,062 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 5 [2022-02-21 03:30:51,065 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:51,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:51,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:51,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:51,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:51,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:51,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:51,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:51,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:51,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:51,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:30:51,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:30:51,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:30:51,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:51,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:51,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:51,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:51,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:51,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:51,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:30:51,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:30:51,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:30:51,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:51,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:51,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:51,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:51,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:51,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:51,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:51,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:51,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:51,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:51,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:51,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:30:51,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:51,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:51,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:51,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:51,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:51,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:51,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:51,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:51,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:51,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:51,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:51,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:51,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:30:51,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:30:51,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:30:51,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:51,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:51,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:51,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,100 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-02-21 03:30:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2022-02-21 03:30:51,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:30:51,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:51,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2022-02-21 03:30:51,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:51,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. cyclomatic complexity: 5 [2022-02-21 03:30:51,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:51,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2022-02-21 03:30:51,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:30:51,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:30:51,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2022-02-21 03:30:51,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:51,110 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-21 03:30:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2022-02-21 03:30:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-02-21 03:30:51,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:51,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 21 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:51,112 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 21 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:51,112 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:51,112 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:51,114 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-21 03:30:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:30:51,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:51,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:51,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 21 transitions. [2022-02-21 03:30:51,115 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 21 transitions. [2022-02-21 03:30:51,115 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:51,116 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-21 03:30:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-21 03:30:51,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:51,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:51,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:51,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-21 03:30:51,117 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:30:51,118 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:30:51,118 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:30:51,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:30:51,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:51,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:51,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:51,119 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:30:51,119 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:30:51,119 INFO L791 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem5#1, main_~x~0#1.base, main_~x~0#1.offset, main_~debug~0#1.base, main_~debug~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~debug~0#1.base, main_~debug~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(0, main_~debug~0#1.base, main_~debug~0#1.offset, 4); 202#L558-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 200#L552-1 assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 188#L553 assume 0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 189#L553-2 [2022-02-21 03:30:51,119 INFO L793 eck$LassoCheckResult]: Loop: 189#L553-2 call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); 194#L558 assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1; 195#L558-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 203#L552-1 assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 204#L553 assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1; 189#L553-2 [2022-02-21 03:30:51,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:51,120 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2022-02-21 03:30:51,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:51,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358005910] [2022-02-21 03:30:51,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:51,144 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:51,164 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:51,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 2 times [2022-02-21 03:30:51,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:51,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739194387] [2022-02-21 03:30:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:51,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:51,178 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:51,190 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:51,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash 705693312, now seen corresponding path program 1 times [2022-02-21 03:30:51,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:51,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86603599] [2022-02-21 03:30:51,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:51,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:51,223 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:51,248 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:51,698 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:51,699 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:51,699 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:51,699 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:51,699 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:51,699 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:51,699 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:51,699 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:51,699 INFO L133 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca.i_Iteration3_Lasso [2022-02-21 03:30:51,699 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:51,699 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:51,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:51,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:51,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,062 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:30:52,064 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:30:52,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:52,513 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:52,514 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:52,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,524 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2022-02-21 03:30:52,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:30:52,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:52,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:52,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:52,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:52,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,568 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2022-02-21 03:30:52,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:30:52,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:52,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:52,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:52,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:52,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,598 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2022-02-21 03:30:52,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:52,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:30:52,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,673 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2022-02-21 03:30:52,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:30:52,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:52,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,726 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2022-02-21 03:30:52,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:52,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:30:52,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,788 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2022-02-21 03:30:52,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:30:52,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:52,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,815 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:52,832 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:30:52,832 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:30:52,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,834 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2022-02-21 03:30:52,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:30:52,836 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:52,856 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:30:52,856 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:52,856 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_2 + 255 Supporting invariants [] [2022-02-21 03:30:52,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,928 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:30:52,931 INFO L390 LassoCheck]: Loop: "call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4);" "assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1;" "call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1;" [2022-02-21 03:30:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:52,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:52,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:52,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:52,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {288#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {288#unseeded} is VALID [2022-02-21 03:30:52,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem5#1, main_~x~0#1.base, main_~x~0#1.offset, main_~debug~0#1.base, main_~debug~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~debug~0#1.base, main_~debug~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(0, main_~debug~0#1.base, main_~debug~0#1.offset, 4); {288#unseeded} is VALID [2022-02-21 03:30:52,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#unseeded} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {288#unseeded} is VALID [2022-02-21 03:30:52,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {288#unseeded} assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {288#unseeded} is VALID [2022-02-21 03:30:52,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {288#unseeded} assume 0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; {288#unseeded} is VALID [2022-02-21 03:30:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:53,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:30:53,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 03:30:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:53,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:53,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#(>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); {291#(>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:53,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#(>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1; {291#(>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:53,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#(>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {379#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1|) (>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))))} is VALID [2022-02-21 03:30:53,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {379#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1|) (>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))))} assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {383#(and (< (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 255) (>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))))} is VALID [2022-02-21 03:30:53,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {383#(and (< (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 255) (>= oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))))} assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1; {356#(or (and (>= oldRank0 0) (> oldRank0 (+ 255 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))) unseeded)} is VALID [2022-02-21 03:30:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:30:53,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2022-02-21 03:30:53,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:53,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,107 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:30:53,107 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2022-02-21 03:30:53,147 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Result 27 states and 32 transitions. Complement of second has 9 states. [2022-02-21 03:30:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:53,147 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:53,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2022-02-21 03:30:53,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2022-02-21 03:30:53,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:53,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2022-02-21 03:30:53,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:53,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,151 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2022-02-21 03:30:53,152 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:53,152 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2022-02-21 03:30:53,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:53,153 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:53,153 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 32 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:53,153 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:30:53,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:53,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:53,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:53,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:30:53,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:30:53,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:30:53,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:53,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:53,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:30:53,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:30:53,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:30:53,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:30:53,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:53,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:53,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:30:53,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:53,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:53,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:30:53,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:53,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:53,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:30:53,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:30:53,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:30:53,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:30:53,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:53,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:53,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:53,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:30:53,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:30:53,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:30:53,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:30:53,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:30:53,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:30:53,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:30:53,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:30:53,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:30:53,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:30:53,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:30:53,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:30:53,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:30:53,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:30:53,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:30:53,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,168 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2022-02-21 03:30:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-02-21 03:30:53,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:30:53,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 10 letters. [2022-02-21 03:30:53,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. cyclomatic complexity: 8 [2022-02-21 03:30:53,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:53,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2022-02-21 03:30:53,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:30:53,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:30:53,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2022-02-21 03:30:53,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:53,173 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-02-21 03:30:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2022-02-21 03:30:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-21 03:30:53,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:53,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 32 transitions. Second operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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) [2022-02-21 03:30:53,174 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 32 transitions. Second operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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) [2022-02-21 03:30:53,174 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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) [2022-02-21 03:30:53,175 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:53,176 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-02-21 03:30:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-02-21 03:30:53,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:53,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:53,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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 27 states and 32 transitions. [2022-02-21 03:30:53,176 INFO L87 Difference]: Start difference. First operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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 27 states and 32 transitions. [2022-02-21 03:30:53,177 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:53,178 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-02-21 03:30:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-02-21 03:30:53,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:53,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:53,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:53,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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) [2022-02-21 03:30:53,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-02-21 03:30:53,179 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-02-21 03:30:53,179 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-02-21 03:30:53,179 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:30:53,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2022-02-21 03:30:53,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:53,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,180 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2022-02-21 03:30:53,181 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:30:53,181 INFO L791 eck$LassoCheckResult]: Stem: 431#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem5#1, main_~x~0#1.base, main_~x~0#1.offset, main_~debug~0#1.base, main_~debug~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~debug~0#1.base, main_~debug~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(0, main_~debug~0#1.base, main_~debug~0#1.offset, 4); 441#L558-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 443#L552-1 assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 447#L553 assume 0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 444#L553-2 call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); 446#L558 assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1; 449#L558-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 442#L552-1 assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 427#L553 assume 0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 428#L553-2 [2022-02-21 03:30:53,181 INFO L793 eck$LassoCheckResult]: Loop: 428#L553-2 call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); 437#L558 assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1; 438#L558-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 439#L552-1 assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 448#L553 assume !(0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2));havoc main_#t~mem6#1;call main_#t~mem9#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(2 + main_#t~mem9#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem9#1; 428#L553-2 [2022-02-21 03:30:53,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:53,181 INFO L85 PathProgramCache]: Analyzing trace with hash 705693310, now seen corresponding path program 1 times [2022-02-21 03:30:53,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:53,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524898668] [2022-02-21 03:30:53,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:53,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:53,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {559#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {559#true} is VALID [2022-02-21 03:30:53,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {559#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem5#1, main_~x~0#1.base, main_~x~0#1.offset, main_~debug~0#1.base, main_~debug~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~debug~0#1.base, main_~debug~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(main_#t~nondet4#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet4#1;call write~int(0, main_~debug~0#1.base, main_~debug~0#1.offset, 4); {559#true} is VALID [2022-02-21 03:30:53,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {559#true} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {561#(= |ULTIMATE.start_main_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-21 03:30:53,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {561#(= |ULTIMATE.start_main_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {562#(or (<= |ULTIMATE.start_main_#t~mem6#1| (* (div |ULTIMATE.start_main_#t~mem6#1| 2) 2)) (<= (+ |ULTIMATE.start_main_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (* (div (+ |ULTIMATE.start_main_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 2) 2)))} is VALID [2022-02-21 03:30:53,275 INFO L290 TraceCheckUtils]: 4: Hoare triple {562#(or (<= |ULTIMATE.start_main_#t~mem6#1| (* (div |ULTIMATE.start_main_#t~mem6#1| 2) 2)) (<= (+ |ULTIMATE.start_main_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (* (div (+ |ULTIMATE.start_main_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 2) 2)))} assume 0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; {563#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (* 2 (div (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 2)))} is VALID [2022-02-21 03:30:53,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {563#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (* 2 (div (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 2)))} call main_#t~mem10#1 := read~int(main_~debug~0#1.base, main_~debug~0#1.offset, 4); {563#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (* 2 (div (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 2)))} is VALID [2022-02-21 03:30:53,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {563#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (* 2 (div (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 2)))} assume !(0 != main_#t~mem10#1);havoc main_#t~mem10#1; {563#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (* 2 (div (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 2)))} is VALID [2022-02-21 03:30:53,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (* 2 (div (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 2)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {564#(and (<= (+ |ULTIMATE.start_main_#t~mem5#1| 2) (* (div (+ |ULTIMATE.start_main_#t~mem5#1| 2) 2) 2)) (= |ULTIMATE.start_main_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:53,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {564#(and (<= (+ |ULTIMATE.start_main_#t~mem5#1| 2) (* (div (+ |ULTIMATE.start_main_#t~mem5#1| 2) 2) 2)) (= |ULTIMATE.start_main_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!(main_#t~mem5#1 < 255);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {565#(<= |ULTIMATE.start_main_#t~mem6#1| (* (div |ULTIMATE.start_main_#t~mem6#1| 2) 2))} is VALID [2022-02-21 03:30:53,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#(<= |ULTIMATE.start_main_#t~mem6#1| (* (div |ULTIMATE.start_main_#t~mem6#1| 2) 2))} assume 0 != (if main_#t~mem6#1 < 0 && 0 != main_#t~mem6#1 % 2 then main_#t~mem6#1 % 2 - 2 else main_#t~mem6#1 % 2);havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int(main_#t~post8#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; {560#false} is VALID [2022-02-21 03:30:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:30:53,278 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:30:53,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524898668] [2022-02-21 03:30:53,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524898668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:30:53,279 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:30:53,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:30:53,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147475909] [2022-02-21 03:30:53,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:30:53,279 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:30:53,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 3 times [2022-02-21 03:30:53,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:53,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422220290] [2022-02-21 03:30:53,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:53,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:53,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:53,294 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:53,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:30:53,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:30:53,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:30:53,366 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:53,450 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-21 03:30:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:30:53,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:53,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2022-02-21 03:30:53,462 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:53,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2022-02-21 03:30:53,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:30:53,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:30:53,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:30:53,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:30:53,462 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:30:53,462 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:30:53,462 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:30:53,462 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:30:53,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:30:53,462 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:53,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:53,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:30:53 BoogieIcfgContainer [2022-02-21 03:30:53,467 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:30:53,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:30:53,468 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:30:53,468 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:30:53,468 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:48" (3/4) ... [2022-02-21 03:30:53,470 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:30:53,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:30:53,471 INFO L158 Benchmark]: Toolchain (without parser) took 6532.02ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 89.8MB in the beginning and 67.8MB in the end (delta: 22.0MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2022-02-21 03:30:53,471 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 79.7MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:30:53,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.09ms. Allocated memory is still 123.7MB. Free memory was 89.6MB in the beginning and 92.9MB in the end (delta: -3.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:30:53,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.51ms. Allocated memory is still 123.7MB. Free memory was 92.5MB in the beginning and 90.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:30:53,472 INFO L158 Benchmark]: Boogie Preprocessor took 41.66ms. Allocated memory is still 123.7MB. Free memory was 90.8MB in the beginning and 89.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:30:53,473 INFO L158 Benchmark]: RCFGBuilder took 420.96ms. Allocated memory is still 123.7MB. Free memory was 89.5MB in the beginning and 77.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:30:53,473 INFO L158 Benchmark]: BuchiAutomizer took 5422.43ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 77.4MB in the beginning and 67.8MB in the end (delta: 9.6MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2022-02-21 03:30:53,473 INFO L158 Benchmark]: Witness Printer took 2.26ms. Allocated memory is still 151.0MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:30:53,475 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 79.7MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 588.09ms. Allocated memory is still 123.7MB. Free memory was 89.6MB in the beginning and 92.9MB in the end (delta: -3.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.51ms. Allocated memory is still 123.7MB. Free memory was 92.5MB in the beginning and 90.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.66ms. Allocated memory is still 123.7MB. Free memory was 90.8MB in the beginning and 89.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 420.96ms. Allocated memory is still 123.7MB. Free memory was 89.5MB in the beginning and 77.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 5422.43ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 77.4MB in the beginning and 67.8MB in the end (delta: 9.6MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * Witness Printer took 2.26ms. Allocated memory is still 151.0MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 255 + -1 * unknown-#memory_int-unknown[x][x] and consists of 5 locations. One deterministic module has affine ranking function 255 + -1 * unknown-#memory_int-unknown[x][x] and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 4.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 24 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital242 mio100 ax107 hnf100 lsp89 ukn60 mio100 lsp37 div161 bol100 ite100 ukn100 eq155 hnf94 smp66 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:30:53,500 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 Writing output log to file Ultimate.log Result: TRUE