./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Velroyen-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/Velroyen-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 0301294b5b50ee43814efe2bd49b834b2b8f0455334e679e746f10ee76ed616a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:31:11,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:31:11,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:31:11,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:31:11,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:31:11,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:31:11,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:31:11,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:31:11,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:31:11,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:31:11,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:31:11,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:31:11,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:31:11,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:31:11,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:31:11,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:31:11,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:31:11,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:31:11,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:31:11,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:31:11,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:31:11,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:31:11,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:31:11,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:31:11,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:31:11,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:31:11,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:31:11,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:31:11,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:31:11,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:31:11,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:31:11,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:31:11,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:31:11,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:31:11,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:31:11,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:31:11,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:31:11,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:31:11,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:31:11,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:31:11,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:31:11,519 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:31:11,553 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:31:11,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:31:11,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:31:11,554 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:31:11,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:31:11,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:31:11,555 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:31:11,556 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:31:11,556 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:31:11,556 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:31:11,557 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:31:11,557 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:31:11,557 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:31:11,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:31:11,558 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:31:11,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:31:11,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:31:11,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:31:11,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:31:11,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:31:11,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:31:11,559 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:31:11,559 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:31:11,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:31:11,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:31:11,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:31:11,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:31:11,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:31:11,562 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:31:11,562 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 -> 0301294b5b50ee43814efe2bd49b834b2b8f0455334e679e746f10ee76ed616a [2022-02-21 03:31:11,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:31:11,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:31:11,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:31:11,858 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:31:11,858 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:31:11,859 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2022-02-21 03:31:11,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71ee694c/ce6d75ad0c5a4277bbba62965ae9e9be/FLAG1b9d82c96 [2022-02-21 03:31:12,364 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:31:12,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2022-02-21 03:31:12,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71ee694c/ce6d75ad0c5a4277bbba62965ae9e9be/FLAG1b9d82c96 [2022-02-21 03:31:12,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71ee694c/ce6d75ad0c5a4277bbba62965ae9e9be [2022-02-21 03:31:12,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:31:12,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:31:12,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:31:12,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:31:12,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:31:12,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:31:12" (1/1) ... [2022-02-21 03:31:12,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f55c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:12, skipping insertion in model container [2022-02-21 03:31:12,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:31:12" (1/1) ... [2022-02-21 03:31:12,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:31:12,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:31:12,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:31:12,755 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:31:12,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:31:12,839 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:31:12,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:12 WrapperNode [2022-02-21 03:31:12,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:31:12,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:31:12,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:31:12,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:31:12,848 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:31:12" (1/1) ... [2022-02-21 03:31:12,867 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:31:12" (1/1) ... [2022-02-21 03:31:12,893 INFO L137 Inliner]: procedures = 110, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2022-02-21 03:31:12,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:31:12,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:31:12,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:31:12,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:31:12,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:12" (1/1) ... [2022-02-21 03:31:12,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:12" (1/1) ... [2022-02-21 03:31:12,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:12" (1/1) ... [2022-02-21 03:31:12,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:12" (1/1) ... [2022-02-21 03:31:12,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:12" (1/1) ... [2022-02-21 03:31:12,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:12" (1/1) ... [2022-02-21 03:31:12,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:12" (1/1) ... [2022-02-21 03:31:12,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:31:12,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:31:12,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:31:12,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:31:12,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:12" (1/1) ... [2022-02-21 03:31:12,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:12,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:12,968 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:31:12,996 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:31:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:31:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:31:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:31:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:31:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:31:13,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:31:13,102 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:31:13,104 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:31:13,350 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:31:13,355 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:31:13,355 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:31:13,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:31:13 BoogieIcfgContainer [2022-02-21 03:31:13,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:31:13,357 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:31:13,357 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:31:13,360 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:31:13,361 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:31:13,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:31:12" (1/3) ... [2022-02-21 03:31:13,362 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dd4fac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:31:13, skipping insertion in model container [2022-02-21 03:31:13,362 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:31:13,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:31:12" (2/3) ... [2022-02-21 03:31:13,362 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dd4fac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:31:13, skipping insertion in model container [2022-02-21 03:31:13,362 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:31:13,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:31:13" (3/3) ... [2022-02-21 03:31:13,364 INFO L388 chiAutomizerObserver]: Analyzing ICFG Velroyen-alloca.i [2022-02-21 03:31:13,400 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:31:13,400 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:31:13,400 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:31:13,400 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:31:13,401 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:31:13,401 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:31:13,401 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:31:13,401 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:31:13,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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:31:13,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:31:13,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:13,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:13,443 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:31:13,443 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:31:13,443 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:31:13,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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:31:13,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:31:13,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:13,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:13,452 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:31:13,452 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:31:13,458 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12#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~nondet3#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem4#1, main_~x~0#1.base, main_~x~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 write~int(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1; 7#L552-3true [2022-02-21 03:31:13,458 INFO L793 eck$LassoCheckResult]: Loop: 7#L552-3true call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 11#L551-1true assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 13#L552true assume !main_#t~short7#1; 3#L552-2true assume !main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call write~int(0, main_~x~0#1.base, main_~x~0#1.offset, 4); 7#L552-3true [2022-02-21 03:31:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:13,464 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:31:13,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:13,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088894560] [2022-02-21 03:31:13,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:13,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:13,560 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:13,595 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:13,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1144151, now seen corresponding path program 1 times [2022-02-21 03:31:13,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:13,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979384941] [2022-02-21 03:31:13,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:13,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:13,633 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:13,645 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:13,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:13,647 INFO L85 PathProgramCache]: Analyzing trace with hash 889571353, now seen corresponding path program 1 times [2022-02-21 03:31:13,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:13,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250802879] [2022-02-21 03:31:13,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:13,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:13,690 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:14,053 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:31:14,054 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:31:14,054 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:31:14,054 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:31:14,055 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:31:14,055 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:14,055 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:31:14,055 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:31:14,055 INFO L133 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca.i_Iteration1_Lasso [2022-02-21 03:31:14,055 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:31:14,056 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:31:14,071 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:31:14,077 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:31:14,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:31:14,083 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:31:14,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:31:14,090 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:31:14,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:31:14,096 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:31:14,099 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:31:14,102 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:31:14,106 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:31:14,108 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:31:14,244 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:31:14,245 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:31:14,254 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:31:14,257 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:31:14,260 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:31:14,568 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:31:14,571 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:31:14,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:14,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:14,575 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:31:14,587 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:31:14,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:14,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:14,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:14,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:14,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:14,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:14,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:14,595 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:31:14,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:14,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:14,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:14,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:14,639 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:31:14,640 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:31:14,642 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:31:14,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:14,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:14,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:14,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:14,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:14,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:14,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:14,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:14,696 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:31:14,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:14,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:14,698 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:31:14,699 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:31:14,704 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:31:14,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:14,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:14,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:14,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:14,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:14,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:14,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:14,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:14,751 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:31:14,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:14,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:14,753 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:31:14,762 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:31:14,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:14,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:14,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:14,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:14,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:14,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:14,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:14,772 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:31:14,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:14,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:14,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:14,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:14,806 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:31:14,807 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:31:14,808 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:31:14,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:14,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:14,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:14,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:14,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:14,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:14,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:14,864 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:31:14,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:14,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:14,866 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:31:14,873 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:31:14,874 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:31:14,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:14,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:14,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:14,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:14,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:14,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:14,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:14,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:14,924 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:31:14,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:14,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:14,925 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:31:14,932 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:31:14,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:14,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:14,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:14,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:14,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:14,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:14,948 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:31:14,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:14,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:31:14,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:14,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:14,974 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:31:14,975 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:31:14,976 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:31:14,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:14,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:14,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:14,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:14,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:14,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:15,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:15,022 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:31:15,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:15,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:15,023 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:31:15,030 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:31:15,032 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:31:15,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:15,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:15,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:15,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:15,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:15,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:15,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:15,087 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:31:15,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:15,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:15,089 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:31:15,097 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:31:15,098 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:31:15,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:15,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:15,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:15,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:15,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:15,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:15,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:15,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:31:15,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:15,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:15,136 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:31:15,136 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:31:15,138 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:31:15,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:15,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:31:15,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:15,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:15,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:15,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:31:15,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:31:15,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:15,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:31:15,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:15,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:15,185 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:31:15,186 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:31:15,190 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:31:15,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:15,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:15,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:15,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:15,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:15,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:15,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:15,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:15,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:15,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:15,244 INFO L229 MonitoredProcess]: Starting monitored process 14 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:31:15,254 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:31:15,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:15,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:15,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:15,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:15,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:15,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:15,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:31:15,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:15,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:15,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:15,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:15,302 INFO L229 MonitoredProcess]: Starting monitored process 15 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:31:15,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:31:15,304 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:31:15,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:15,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:15,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:15,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:15,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:15,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:15,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:31:15,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:15,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:15,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:15,346 INFO L229 MonitoredProcess]: Starting monitored process 16 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:31:15,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:31:15,348 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:31:15,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:31:15,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:31:15,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:31:15,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:31:15,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:31:15,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:31:15,368 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:31:15,393 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:31:15,394 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:31:15,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:31:15,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:31:15,423 INFO L229 MonitoredProcess]: Starting monitored process 17 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:31:15,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:31:15,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:31:15,504 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:31:15,504 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:31:15,505 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 Supporting invariants [] [2022-02-21 03:31:15,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:15,553 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:31:15,565 INFO L390 LassoCheck]: Loop: "call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);" "assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1;" "assume !main_#t~short7#1;" "assume !main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call write~int(0, main_~x~0#1.base, main_~x~0#1.offset, 4);" [2022-02-21 03:31:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:15,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:15,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:31:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:15,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:15,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {22#unseeded} is VALID [2022-02-21 03:31:15,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#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~nondet3#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem4#1, main_~x~0#1.base, main_~x~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 write~int(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1; {22#unseeded} is VALID [2022-02-21 03:31:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:15,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:31:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:15,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:15,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {25#(>= oldRank0 (* (- 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:31:15,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#(>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; {61#(and (or (< (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) |ULTIMATE.start_main_#t~short7#1|) (>= oldRank0 (* (- 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:31:15,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {61#(and (or (< (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) |ULTIMATE.start_main_#t~short7#1|) (>= oldRank0 (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume !main_#t~short7#1; {65#(and (< (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (<= 0 (+ 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:31:15,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {65#(and (< (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (<= 0 (+ oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume !main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call write~int(0, main_~x~0#1.base, main_~x~0#1.offset, 4); {50#(or (and (>= oldRank0 0) (> oldRank0 (* (- 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:31:15,788 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:31:15,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:31:15,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:15,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 4 letters. [2022-02-21 03:31:15,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:15,829 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:31:15,830 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:31:15,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:31:16,022 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 42 states and 56 transitions. Complement of second has 10 states. [2022-02-21 03:31:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:31:16,023 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:16,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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:31:16,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:31:16,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:16,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:16,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:31:16,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:31:16,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:16,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:16,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 56 transitions. [2022-02-21 03:31:16,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:31:16,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:16,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:16,045 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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:31:16,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:31:16,047 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:31:16,048 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:31:16,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:31:16,050 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:31:16,050 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 56 transitions. cyclomatic complexity: 16 [2022-02-21 03:31:16,053 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:31:16,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 4 letters. [2022-02-21 03:31:16,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 4 letters. [2022-02-21 03:31:16,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:31:16,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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:31:16,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:31:16,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:31:16,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 4 letters. [2022-02-21 03:31:16,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 4 letters. [2022-02-21 03:31:16,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:31:16,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 42 letters. Loop has 42 letters. [2022-02-21 03:31:16,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 42 letters. Loop has 42 letters. [2022-02-21 03:31:16,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:31:16,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 12 letters. [2022-02-21 03:31:16,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 12 letters. [2022-02-21 03:31:16,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:31:16,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 6 letters. [2022-02-21 03:31:16,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 letters. [2022-02-21 03:31:16,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:31:16,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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:31:16,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:31:16,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:31:16,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 6 letters. [2022-02-21 03:31:16,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 letters. [2022-02-21 03:31:16,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:31:16,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 4 letters. [2022-02-21 03:31:16,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 4 letters. [2022-02-21 03:31:16,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:31:16,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 4 letters. [2022-02-21 03:31:16,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 4 letters. [2022-02-21 03:31:16,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:31:16,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 4 letters. [2022-02-21 03:31:16,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 4 letters. [2022-02-21 03:31:16,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:31:16,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 4 letters. [2022-02-21 03:31:16,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 4 letters. [2022-02-21 03:31:16,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:31:16,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 1 letters. [2022-02-21 03:31:16,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 1 letters. [2022-02-21 03:31:16,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:31:16,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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:31:16,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:31:16,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:31:16,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 4 letters. [2022-02-21 03:31:16,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 4 letters. [2022-02-21 03:31:16,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:31:16,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 4 letters. [2022-02-21 03:31:16,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 4 letters. [2022-02-21 03:31:16,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:31:16,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 4 letters. [2022-02-21 03:31:16,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 4 letters. [2022-02-21 03:31:16,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:31:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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:31:16,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:31:16,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:31:16,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 6 letters. [2022-02-21 03:31:16,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 letters. [2022-02-21 03:31:16,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:31:16,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 4 letters. [2022-02-21 03:31:16,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 4 letters. [2022-02-21 03:31:16,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 56 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:31:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,091 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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:31:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-02-21 03:31:16,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:31:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:31:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 8 letters. [2022-02-21 03:31:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. cyclomatic complexity: 16 [2022-02-21 03:31:16,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:31:16,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 23 states and 35 transitions. [2022-02-21 03:31:16,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:31:16,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:31:16,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2022-02-21 03:31:16,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:31:16,113 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2022-02-21 03:31:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2022-02-21 03:31:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-02-21 03:31:16,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:16,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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:31:16,135 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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:31:16,137 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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:31:16,139 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:16,142 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2022-02-21 03:31:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. [2022-02-21 03:31:16,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:16,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:16,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 23 states and 35 transitions. [2022-02-21 03:31:16,144 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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 23 states and 35 transitions. [2022-02-21 03:31:16,144 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:16,147 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2022-02-21 03:31:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. [2022-02-21 03:31:16,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:16,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:16,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:16,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 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:31:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2022-02-21 03:31:16,153 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-02-21 03:31:16,153 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-02-21 03:31:16,153 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:31:16,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2022-02-21 03:31:16,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:31:16,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:16,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:16,157 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:31:16,157 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:31:16,157 INFO L791 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 133#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~nondet3#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem4#1, main_~x~0#1.base, main_~x~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 write~int(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1; 140#L552-3 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 137#L551-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 138#L552 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35; 142#L552-2 [2022-02-21 03:31:16,157 INFO L793 eck$LassoCheckResult]: Loop: 142#L552-2 assume !main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call write~int(0, main_~x~0#1.base, main_~x~0#1.offset, 4); 134#L552-3 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 135#L551-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 141#L552 assume !main_#t~short7#1; 142#L552-2 [2022-02-21 03:31:16,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:16,158 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2022-02-21 03:31:16,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:16,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452027267] [2022-02-21 03:31:16,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:16,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:16,201 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:16,224 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:16,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1943531, now seen corresponding path program 2 times [2022-02-21 03:31:16,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:16,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778929603] [2022-02-21 03:31:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:16,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {239#true} assume !main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call write~int(0, main_~x~0#1.base, main_~x~0#1.offset, 4); {241#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} is VALID [2022-02-21 03:31:16,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#(= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {242#(= |ULTIMATE.start_main_#t~mem4#1| 0)} is VALID [2022-02-21 03:31:16,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {242#(= |ULTIMATE.start_main_#t~mem4#1| 0)} assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; {240#false} is VALID [2022-02-21 03:31:16,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {240#false} assume !main_#t~short7#1; {240#false} is VALID [2022-02-21 03:31:16,297 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:31:16,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:16,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778929603] [2022-02-21 03:31:16,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778929603] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:16,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:16,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:31:16,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569009039] [2022-02-21 03:31:16,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:16,305 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:31:16,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:16,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:31:16,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:31:16,308 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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:31:16,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:16,358 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-21 03:31:16,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:31:16,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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:31:16,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:16,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2022-02-21 03:31:16,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:31:16,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 27 transitions. [2022-02-21 03:31:16,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:31:16,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:31:16,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-02-21 03:31:16,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:31:16,369 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 03:31:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-02-21 03:31:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 03:31:16,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:16,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 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:31:16,374 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 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:31:16,374 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 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:31:16,375 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:16,376 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 03:31:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-02-21 03:31:16,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:16,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:16,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 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 20 states and 27 transitions. [2022-02-21 03:31:16,377 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 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 20 states and 27 transitions. [2022-02-21 03:31:16,377 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:16,378 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 03:31:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-02-21 03:31:16,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:16,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:16,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:16,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 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:31:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-02-21 03:31:16,382 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 03:31:16,382 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 03:31:16,382 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:31:16,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-02-21 03:31:16,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:31:16,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:16,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:16,383 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:31:16,383 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:31:16,383 INFO L791 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 282#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~nondet3#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem4#1, main_~x~0#1.base, main_~x~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 write~int(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1; 285#L552-3 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 280#L551-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 283#L552 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35; 286#L552-2 [2022-02-21 03:31:16,383 INFO L793 eck$LassoCheckResult]: Loop: 286#L552-2 assume main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 287#L553 assume main_#t~mem8#1 < 0;havoc main_#t~mem8#1;call write~int(-5, main_~x~0#1.base, main_~x~0#1.offset, 4); 277#L552-3 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 278#L551-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 289#L552 assume !main_#t~short7#1; 286#L552-2 [2022-02-21 03:31:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 2 times [2022-02-21 03:31:16,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:16,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801874489] [2022-02-21 03:31:16,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:16,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:16,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:16,432 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:16,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:16,433 INFO L85 PathProgramCache]: Analyzing trace with hash 48745192, now seen corresponding path program 1 times [2022-02-21 03:31:16,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:16,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675560259] [2022-02-21 03:31:16,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:16,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:16,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {375#true} assume main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {375#true} is VALID [2022-02-21 03:31:16,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {375#true} assume main_#t~mem8#1 < 0;havoc main_#t~mem8#1;call write~int(-5, main_~x~0#1.base, main_~x~0#1.offset, 4); {377#(<= 0 (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:31:16,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= 0 (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); {377#(<= 0 (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:31:16,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {377#(<= 0 (+ 5 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; {378#|ULTIMATE.start_main_#t~short7#1|} is VALID [2022-02-21 03:31:16,498 INFO L290 TraceCheckUtils]: 4: Hoare triple {378#|ULTIMATE.start_main_#t~short7#1|} assume !main_#t~short7#1; {376#false} is VALID [2022-02-21 03:31:16,498 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:31:16,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:31:16,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675560259] [2022-02-21 03:31:16,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675560259] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:31:16,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:31:16,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:31:16,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269871326] [2022-02-21 03:31:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:31:16,500 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:31:16,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:31:16,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:31:16,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:31:16,501 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:31:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:31:16,583 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-21 03:31:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:31:16,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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:31:16,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:16,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2022-02-21 03:31:16,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-02-21 03:31:16,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 36 transitions. [2022-02-21 03:31:16,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-02-21 03:31:16,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-02-21 03:31:16,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2022-02-21 03:31:16,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:31:16,595 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-21 03:31:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2022-02-21 03:31:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-02-21 03:31:16,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:31:16,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 36 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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:31:16,599 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 36 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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:31:16,599 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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:31:16,599 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:16,600 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-21 03:31:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-21 03:31:16,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:16,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:16,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 28 states and 36 transitions. [2022-02-21 03:31:16,601 INFO L87 Difference]: Start difference. First operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 28 states and 36 transitions. [2022-02-21 03:31:16,601 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:31:16,604 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-21 03:31:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-21 03:31:16,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:31:16,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:31:16,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:31:16,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:31:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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:31:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-21 03:31:16,608 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-21 03:31:16,608 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-21 03:31:16,608 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:31:16,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2022-02-21 03:31:16,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-02-21 03:31:16,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:16,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:16,613 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:31:16,613 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:31:16,613 INFO L791 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 418#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~nondet3#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem4#1, main_~x~0#1.base, main_~x~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 write~int(main_#t~nondet3#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet3#1; 421#L552-3 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 426#L551-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 427#L552 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35; 411#L552-2 [2022-02-21 03:31:16,613 INFO L793 eck$LassoCheckResult]: Loop: 411#L552-2 assume main_#t~short7#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;call main_#t~mem8#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 412#L553 assume main_#t~mem8#1 < 0;havoc main_#t~mem8#1;call write~int(-5, main_~x~0#1.base, main_~x~0#1.offset, 4); 415#L552-3 call main_#t~mem4#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4); 416#L551-1 assume !!(0 != main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := -5 <= main_#t~mem5#1; 420#L552 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 <= 35; 411#L552-2 [2022-02-21 03:31:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 3 times [2022-02-21 03:31:16,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:16,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900578167] [2022-02-21 03:31:16,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:16,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:16,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:16,675 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:16,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:16,675 INFO L85 PathProgramCache]: Analyzing trace with hash 48745190, now seen corresponding path program 1 times [2022-02-21 03:31:16,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:16,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966394205] [2022-02-21 03:31:16,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:16,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:16,687 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:16,692 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash 707540352, now seen corresponding path program 1 times [2022-02-21 03:31:16,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:31:16,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585613856] [2022-02-21 03:31:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:31:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:31:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:16,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:31:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:31:16,722 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:31:17,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:31:17 BoogieIcfgContainer [2022-02-21 03:31:17,146 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:31:17,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:31:17,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:31:17,147 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:31:17,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:31:13" (3/4) ... [2022-02-21 03:31:17,149 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 03:31:17,197 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:31:17,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:31:17,200 INFO L158 Benchmark]: Toolchain (without parser) took 4804.94ms. Allocated memory was 88.1MB in the beginning and 134.2MB in the end (delta: 46.1MB). Free memory was 52.5MB in the beginning and 68.4MB in the end (delta: -16.0MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2022-02-21 03:31:17,201 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 58.7MB in the beginning and 58.7MB in the end (delta: 23.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:31:17,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.25ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 52.3MB in the beginning and 80.1MB in the end (delta: -27.8MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-02-21 03:31:17,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.58ms. Allocated memory is still 111.1MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:31:17,202 INFO L158 Benchmark]: Boogie Preprocessor took 42.02ms. Allocated memory is still 111.1MB. Free memory was 78.0MB in the beginning and 77.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:31:17,202 INFO L158 Benchmark]: RCFGBuilder took 418.61ms. Allocated memory is still 111.1MB. Free memory was 76.7MB in the beginning and 64.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:31:17,203 INFO L158 Benchmark]: BuchiAutomizer took 3789.21ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 64.8MB in the beginning and 70.5MB in the end (delta: -5.7MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2022-02-21 03:31:17,203 INFO L158 Benchmark]: Witness Printer took 52.68ms. Allocated memory is still 134.2MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:31:17,208 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.17ms. Allocated memory is still 88.1MB. Free memory was 58.7MB in the beginning and 58.7MB in the end (delta: 23.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.25ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 52.3MB in the beginning and 80.1MB in the end (delta: -27.8MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.58ms. Allocated memory is still 111.1MB. Free memory was 80.1MB in the beginning and 78.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.02ms. Allocated memory is still 111.1MB. Free memory was 78.0MB in the beginning and 77.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 418.61ms. Allocated memory is still 111.1MB. Free memory was 76.7MB in the beginning and 64.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3789.21ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 64.8MB in the beginning and 70.5MB in the end (delta: -5.7MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Witness Printer took 52.68ms. Allocated memory is still 134.2MB. Free memory was 70.5MB in the beginning and 68.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 29 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax118 hnf100 lsp79 ukn77 mio100 lsp42 div100 bol100 ite100 ukn100 eq153 hnf91 smp85 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 552]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {x=2, x=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@5bb7bf46=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5aaeecff=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@3ac1f1d5=-5, NULL=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@1b35d4bf=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@677414e1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@26e366d=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@10ab94f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@74d10d0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2da5930d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@677414e1=2} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 552]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 Loop: [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:31:17,254 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)