./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_ptr_single_elem_init-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/array-industry-pattern/array_ptr_single_elem_init-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b073cc2eb0b196ef0c05471292790dfe61756b839736ddb49ad92ee60513afd2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:36:39,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:36:39,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:36:39,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:36:39,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:36:39,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:36:39,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:36:39,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:36:39,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:36:39,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:36:39,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:36:39,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:36:39,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:36:39,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:36:39,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:36:39,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:36:39,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:36:39,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:36:39,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:36:39,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:36:39,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:36:39,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:36:39,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:36:39,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:36:39,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:36:39,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:36:39,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:36:39,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:36:39,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:36:39,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:36:39,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:36:39,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:36:39,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:36:39,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:36:39,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:36:39,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:36:39,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:36:39,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:36:39,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:36:39,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:36:39,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:36:39,781 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:36:39,808 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:36:39,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:36:39,809 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:36:39,809 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:36:39,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:36:39,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:36:39,810 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:36:39,810 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:36:39,810 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:36:39,810 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:36:39,810 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:36:39,811 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:36:39,811 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:36:39,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:36:39,811 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:36:39,811 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:36:39,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:36:39,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:36:39,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:36:39,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:36:39,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:36:39,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:36:39,812 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:36:39,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:36:39,812 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:36:39,813 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:36:39,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:36:39,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:36:39,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:36:39,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:36:39,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:36:39,814 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:36:39,814 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b073cc2eb0b196ef0c05471292790dfe61756b839736ddb49ad92ee60513afd2 [2022-02-21 03:36:40,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:36:40,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:36:40,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:36:40,033 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:36:40,034 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:36:40,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_ptr_single_elem_init-2.i [2022-02-21 03:36:40,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930aaeeb6/8fb136d200a344c0ac672efefb17871d/FLAGa07263981 [2022-02-21 03:36:40,435 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:36:40,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_ptr_single_elem_init-2.i [2022-02-21 03:36:40,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930aaeeb6/8fb136d200a344c0ac672efefb17871d/FLAGa07263981 [2022-02-21 03:36:40,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930aaeeb6/8fb136d200a344c0ac672efefb17871d [2022-02-21 03:36:40,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:36:40,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:36:40,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:40,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:36:40,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:36:40,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:40" (1/1) ... [2022-02-21 03:36:40,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42950c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:40, skipping insertion in model container [2022-02-21 03:36:40,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:40" (1/1) ... [2022-02-21 03:36:40,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:36:40,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:36:40,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_ptr_single_elem_init-2.i[821,834] [2022-02-21 03:36:40,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:40,645 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:36:40,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_ptr_single_elem_init-2.i[821,834] [2022-02-21 03:36:40,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:40,682 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:36:40,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:40 WrapperNode [2022-02-21 03:36:40,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:40,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:40,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:36:40,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:36:40,689 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:36:40" (1/1) ... [2022-02-21 03:36:40,700 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:36:40" (1/1) ... [2022-02-21 03:36:40,722 INFO L137 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2022-02-21 03:36:40,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:40,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:36:40,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:36:40,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:36:40,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:40" (1/1) ... [2022-02-21 03:36:40,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:40" (1/1) ... [2022-02-21 03:36:40,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:40" (1/1) ... [2022-02-21 03:36:40,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:40" (1/1) ... [2022-02-21 03:36:40,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:40" (1/1) ... [2022-02-21 03:36:40,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:40" (1/1) ... [2022-02-21 03:36:40,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:40" (1/1) ... [2022-02-21 03:36:40,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:36:40,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:36:40,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:36:40,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:36:40,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:40" (1/1) ... [2022-02-21 03:36:40,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:40,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:40,782 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:36:40,803 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:36:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:36:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:36:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:36:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:36:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:36:40,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:36:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:36:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:36:40,861 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:36:40,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:36:41,055 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:36:41,060 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:36:41,061 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:36:41,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:41 BoogieIcfgContainer [2022-02-21 03:36:41,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:36:41,063 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:36:41,076 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:36:41,078 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:36:41,082 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:41,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:36:40" (1/3) ... [2022-02-21 03:36:41,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c450a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:41, skipping insertion in model container [2022-02-21 03:36:41,083 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:41,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:40" (2/3) ... [2022-02-21 03:36:41,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c450a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:41, skipping insertion in model container [2022-02-21 03:36:41,084 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:41,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:41" (3/3) ... [2022-02-21 03:36:41,085 INFO L388 chiAutomizerObserver]: Analyzing ICFG array_ptr_single_elem_init-2.i [2022-02-21 03:36:41,127 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:36:41,128 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:36:41,128 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:36:41,128 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:36:41,128 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:36:41,128 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:36:41,129 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:36:41,129 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:36:41,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 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:36:41,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:41,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:41,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:41,167 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:41,168 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:41,168 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:36:41,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 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:36:41,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:41,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:41,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:41,173 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:41,174 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:41,178 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~post1#1, main_~q~0#1, main_#t~mem6#1, main_#t~post5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~c~0#1;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~c~0#1;main_~i~0#1 := 0; 4#L21-3true [2022-02-21 03:36:41,179 INFO L793 eck$LassoCheckResult]: Loop: 4#L21-3true assume !!(main_~i~0#1 < 100000);main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 9#L25true assume 0 == main_~q~0#1;call write~int(1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int((if main_~i~0#1 < 0 && 0 != main_~i~0#1 % 2 then main_~i~0#1 % 2 - 2 else main_~i~0#1 % 2), main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 15#L25-2true call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6#L30true assume !(0 != main_#t~mem3#1);havoc main_#t~mem3#1; 18#L21-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 4#L21-3true [2022-02-21 03:36:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:36:41,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:41,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677591023] [2022-02-21 03:36:41,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:41,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:41,284 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:41,316 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:41,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 38268879, now seen corresponding path program 1 times [2022-02-21 03:36:41,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:41,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538352799] [2022-02-21 03:36:41,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:41,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:41,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:41,391 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:41,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:41,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1809708365, now seen corresponding path program 1 times [2022-02-21 03:36:41,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:41,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777000551] [2022-02-21 03:36:41,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:41,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:41,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {27#true} is VALID [2022-02-21 03:36:41,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~post1#1, main_~q~0#1, main_#t~mem6#1, main_#t~post5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~c~0#1;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~c~0#1;main_~i~0#1 := 0; {29#(not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-21 03:36:41,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#(not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume !!(main_~i~0#1 < 100000);main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {29#(not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} is VALID [2022-02-21 03:36:41,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#(not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))} assume 0 == main_~q~0#1;call write~int(1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int((if main_~i~0#1 < 0 && 0 != main_~i~0#1 % 2 then main_~i~0#1 % 2 - 2 else main_~i~0#1 % 2), main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); {30#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1)} is VALID [2022-02-21 03:36:41,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1)} call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {31#(= |ULTIMATE.start_main_#t~mem3#1| 1)} is VALID [2022-02-21 03:36:41,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#(= |ULTIMATE.start_main_#t~mem3#1| 1)} assume !(0 != main_#t~mem3#1);havoc main_#t~mem3#1; {28#false} is VALID [2022-02-21 03:36:41,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#false} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {28#false} is VALID [2022-02-21 03:36:41,540 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:36:41,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:41,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777000551] [2022-02-21 03:36:41,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777000551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:41,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:41,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:36:41,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678467413] [2022-02-21 03:36:41,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:41,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:41,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:36:41,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:36:41,832 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 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 has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:41,971 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-02-21 03:36:41,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:36:41,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:41,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:41,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2022-02-21 03:36:41,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-02-21 03:36:41,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2022-02-21 03:36:41,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 03:36:41,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 03:36:41,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2022-02-21 03:36:41,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:41,997 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-02-21 03:36:42,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2022-02-21 03:36:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-02-21 03:36:42,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:42,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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:36:42,014 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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:36:42,016 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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:36:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:42,018 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2022-02-21 03:36:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-02-21 03:36:42,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:42,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:42,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 24 transitions. [2022-02-21 03:36:42,022 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 24 transitions. [2022-02-21 03:36:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:42,024 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2022-02-21 03:36:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2022-02-21 03:36:42,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:42,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:42,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:42,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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:36:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2022-02-21 03:36:42,031 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:36:42,032 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:36:42,032 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:36:42,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:36:42,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:36:42,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:42,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:42,032 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:42,032 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:42,033 INFO L791 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); 63#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~post1#1, main_~q~0#1, main_#t~mem6#1, main_#t~post5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~c~0#1;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~c~0#1;main_~i~0#1 := 0; 59#L21-3 [2022-02-21 03:36:42,033 INFO L793 eck$LassoCheckResult]: Loop: 59#L21-3 assume !!(main_~i~0#1 < 100000);main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 61#L25 assume !(0 == main_~q~0#1); 69#L25-2 call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 74#L30 assume !(0 != main_#t~mem3#1);havoc main_#t~mem3#1; 71#L21-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 59#L21-3 [2022-02-21 03:36:42,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:36:42,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:42,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513609472] [2022-02-21 03:36:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:42,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:42,042 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:42,048 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:42,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash 38328461, now seen corresponding path program 1 times [2022-02-21 03:36:42,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:42,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072170456] [2022-02-21 03:36:42,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:42,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:42,055 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:42,059 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:42,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767947, now seen corresponding path program 1 times [2022-02-21 03:36:42,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:42,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729907138] [2022-02-21 03:36:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:42,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:42,076 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:42,103 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:42,444 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:42,444 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:42,445 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:42,445 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:42,445 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:42,445 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:42,445 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:42,445 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:42,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_ptr_single_elem_init-2.i_Iteration2_Lasso [2022-02-21 03:36:42,445 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:42,445 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:42,459 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:36:42,482 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:36:42,485 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:36:42,487 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:36:42,489 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:36:42,492 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:36:42,494 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:36:42,498 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:36:42,669 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:36:42,672 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:36:42,674 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:36:42,677 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:36:42,992 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:42,995 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:42,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:42,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:42,998 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:36:43,018 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:36:43,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:43,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:43,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:43,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:43,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:43,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:43,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:43,033 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:36:43,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:43,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:36:43,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:43,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:43,052 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:36:43,058 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:36:43,063 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:36:43,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:43,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:43,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:43,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:43,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:43,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:43,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:43,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:36:43,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:43,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:43,113 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:36:43,113 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:36:43,115 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:36:43,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:43,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:43,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:43,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:43,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:43,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:43,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:43,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:43,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:36:43,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:43,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:43,141 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:36:43,142 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:36:43,143 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:36:43,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:43,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:43,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:43,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:43,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:43,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:43,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:43,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:36:43,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:43,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:43,180 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:36:43,184 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:36:43,185 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:36:43,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:43,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:43,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:43,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:43,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:43,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:43,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:43,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:43,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:36:43,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:43,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:43,216 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:36:43,217 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:36:43,218 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:36:43,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:43,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:43,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:43,224 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:36:43,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:43,226 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:36:43,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:43,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:43,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:36:43,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:43,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:43,259 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:36:43,260 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:36:43,261 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:36:43,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:43,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:43,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:43,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:43,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:43,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:43,287 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:43,305 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-02-21 03:36:43,305 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:36:43,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:43,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:43,319 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:36:43,320 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:36:43,359 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:43,381 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:43,381 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:43,382 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:36:43,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:43,474 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2022-02-21 03:36:43,478 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < 100000);main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(0 == main_~q~0#1);" "call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "assume !(0 != main_#t~mem3#1);havoc main_#t~mem3#1;" "main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" [2022-02-21 03:36:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:43,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:43,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:43,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:43,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {120#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {120#unseeded} is VALID [2022-02-21 03:36:43,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~post1#1, main_~q~0#1, main_#t~mem6#1, main_#t~post5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~c~0#1;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~c~0#1;main_~i~0#1 := 0; {120#unseeded} is VALID [2022-02-21 03:36:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:43,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:36:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:43,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:43,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#(>= oldRank0 (+ (* 199999 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (* (- 8) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < 100000);main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {186#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 199999))) (< |ULTIMATE.start_main_~i~0#1| 100000))} is VALID [2022-02-21 03:36:43,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 199999))) (< |ULTIMATE.start_main_~i~0#1| 100000))} assume !(0 == main_~q~0#1); {186#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 199999))) (< |ULTIMATE.start_main_~i~0#1| 100000))} is VALID [2022-02-21 03:36:43,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 199999))) (< |ULTIMATE.start_main_~i~0#1| 100000))} call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {186#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 199999))) (< |ULTIMATE.start_main_~i~0#1| 100000))} is VALID [2022-02-21 03:36:43,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {186#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 199999))) (< |ULTIMATE.start_main_~i~0#1| 100000))} assume !(0 != main_#t~mem3#1);havoc main_#t~mem3#1; {186#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 199999))) (< |ULTIMATE.start_main_~i~0#1| 100000))} is VALID [2022-02-21 03:36:43,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {186#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 199999))) (< |ULTIMATE.start_main_~i~0#1| 100000))} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {178#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 199999 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (* (- 8) |ULTIMATE.start_main_~i~0#1|)))))} is VALID [2022-02-21 03:36:43,644 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:36:43,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:43,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:43,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:36:43,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,657 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:36:43,658 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:43,723 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 36 transitions. Complement of second has 7 states. [2022-02-21 03:36:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:43,723 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:43,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. cyclomatic complexity: 7 [2022-02-21 03:36:43,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:43,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:43,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:43,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:43,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:43,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:43,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2022-02-21 03:36:43,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:43,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:43,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:43,727 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 7 [2022-02-21 03:36:43,729 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:36:43,729 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:43,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:43,730 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:43,730 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 36 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:43,730 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:36:43,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:36:43,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:36:43,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:36:43,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:43,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:43,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:43,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:36:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:36:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:36:43,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:36:43,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:36:43,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:36:43,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:43,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:43,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:43,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:43,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:43,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:43,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:43,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:43,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:43,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:43,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:43,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:43,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:43,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:43,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:43,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:43,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:43,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:43,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:36:43,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:36:43,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:36:43,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:43,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:43,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:43,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:36:43,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:36:43,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:36:43,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:36:43,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:36:43,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:36:43,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:43,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:43,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:43,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:43,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:43,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:43,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:36:43,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:36:43,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:36:43,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:36:43,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:36:43,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 5 letters. [2022-02-21 03:36:43,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:43,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:43,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:43,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:43,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:43,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:43,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:43,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:43,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:43,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:43,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:43,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:43,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:43,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:43,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:43,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:43,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:43,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:43,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,743 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:36:43,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 5 letters. [2022-02-21 03:36:43,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:43,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 10 letters. [2022-02-21 03:36:43,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:43,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:43,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:43,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 23 transitions. [2022-02-21 03:36:43,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:36:43,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:36:43,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2022-02-21 03:36:43,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:43,746 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 03:36:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2022-02-21 03:36:43,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 03:36:43,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:43,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 23 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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:36:43,748 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 23 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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:36:43,748 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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:36:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:43,748 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-02-21 03:36:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-21 03:36:43,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:43,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:43,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 17 states and 23 transitions. [2022-02-21 03:36:43,749 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 17 states and 23 transitions. [2022-02-21 03:36:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:43,749 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-02-21 03:36:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-21 03:36:43,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:43,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:43,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:43,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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:36:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-02-21 03:36:43,750 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 03:36:43,751 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 03:36:43,751 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:36:43,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2022-02-21 03:36:43,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:43,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:43,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:43,751 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:36:43,751 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:43,752 INFO L791 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); 239#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~post1#1, main_~q~0#1, main_#t~mem6#1, main_#t~post5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~c~0#1;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~c~0#1;main_~i~0#1 := 0; 234#L21-3 assume !(main_~i~0#1 < 100000); 235#L21-4 call write~int(1, main_~#a~0#1.base, 60000 + main_~#a~0#1.offset, 4);main_~i~0#1 := 0; 243#L43-3 [2022-02-21 03:36:43,752 INFO L793 eck$LassoCheckResult]: Loop: 243#L43-3 assume !!(main_~i~0#1 < 100000); 248#L45 assume !(15000 == main_~i~0#1); 242#L43-2 main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 243#L43-3 [2022-02-21 03:36:43,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash 925725, now seen corresponding path program 1 times [2022-02-21 03:36:43,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:43,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871095149] [2022-02-21 03:36:43,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:43,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {288#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {288#true} is VALID [2022-02-21 03:36:43,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~post1#1, main_~q~0#1, main_#t~mem6#1, main_#t~post5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~c~0#1;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~c~0#1;main_~i~0#1 := 0; {290#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:43,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {289#false} is VALID [2022-02-21 03:36:43,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {289#false} call write~int(1, main_~#a~0#1.base, 60000 + main_~#a~0#1.offset, 4);main_~i~0#1 := 0; {289#false} is VALID [2022-02-21 03:36:43,773 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:36:43,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:43,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871095149] [2022-02-21 03:36:43,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871095149] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:43,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:43,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:36:43,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822841245] [2022-02-21 03:36:43,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:43,774 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:43,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash 71947, now seen corresponding path program 1 times [2022-02-21 03:36:43,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:43,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773835239] [2022-02-21 03:36:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:43,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:43,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:43,779 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:43,792 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:43,792 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:43,792 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:43,792 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:43,792 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:36:43,792 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:43,792 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:43,792 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:43,792 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_ptr_single_elem_init-2.i_Iteration3_Loop [2022-02-21 03:36:43,792 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:43,792 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:43,793 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:36:43,794 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:36:43,837 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:43,837 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:36:43,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:43,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:43,840 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:36:43,841 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:36:43,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:36:43,842 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:36:43,872 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:36:43,873 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:36:43,892 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:36:43,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:43,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:43,942 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:36:43,967 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:36:43,970 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:36:43,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:36:43,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:36:44,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:44,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:44,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:44,014 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:36:44,015 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:36:44,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:36:44,017 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:36:44,103 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:36:44,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:44,111 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:44,112 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:44,112 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:44,112 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:44,112 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:44,112 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:44,112 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:44,112 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:44,112 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_ptr_single_elem_init-2.i_Iteration3_Loop [2022-02-21 03:36:44,112 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:44,112 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:44,113 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:36:44,115 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:36:44,167 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:44,167 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:44,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:44,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:44,176 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:36:44,177 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:36:44,179 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:36:44,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:44,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:44,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:44,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:44,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:44,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:44,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:44,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:44,241 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:36:44,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:44,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:44,243 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:36:44,244 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:36:44,245 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:36:44,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:44,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:44,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:44,251 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:36:44,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:44,252 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:36:44,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:44,267 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:44,280 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:36:44,280 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:36:44,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:44,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:44,281 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:36:44,283 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:36:44,284 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:44,284 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:36:44,284 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:44,284 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 199999 Supporting invariants [] [2022-02-21 03:36:44,305 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:36:44,311 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:36:44,316 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < 100000);" "assume !(15000 == main_~i~0#1);" "main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2022-02-21 03:36:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:44,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:44,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:44,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2); {293#unseeded} is VALID [2022-02-21 03:36:44,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~mem3#1, main_#t~mem4#1, main_#t~post1#1, main_~q~0#1, main_#t~mem6#1, main_#t~post5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~c~0#1;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~c~0#1;main_~i~0#1 := 0; {293#unseeded} is VALID [2022-02-21 03:36:44,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#unseeded} assume !(main_~i~0#1 < 100000); {293#unseeded} is VALID [2022-02-21 03:36:44,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {293#unseeded} call write~int(1, main_~#a~0#1.base, 60000 + main_~#a~0#1.offset, 4);main_~i~0#1 := 0; {293#unseeded} is VALID [2022-02-21 03:36:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:44,360 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:36:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:44,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:44,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {296#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 199999))} assume !!(main_~i~0#1 < 100000); {320#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 199999)) (< |ULTIMATE.start_main_~i~0#1| 100000))} is VALID [2022-02-21 03:36:44,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 199999)) (< |ULTIMATE.start_main_~i~0#1| 100000))} assume !(15000 == main_~i~0#1); {320#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 199999)) (< |ULTIMATE.start_main_~i~0#1| 100000))} is VALID [2022-02-21 03:36:44,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {320#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 199999)) (< |ULTIMATE.start_main_~i~0#1| 100000))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {306#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 199999))))} is VALID [2022-02-21 03:36:44,388 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:36:44,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:44,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:44,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:44,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,393 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:36:44,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:44,426 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 30 transitions. Complement of second has 4 states. [2022-02-21 03:36:44,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:44,426 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:44,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. cyclomatic complexity: 8 [2022-02-21 03:36:44,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:44,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:44,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:44,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:44,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:44,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:44,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2022-02-21 03:36:44,429 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:44,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:44,429 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 23 transitions. cyclomatic complexity: 8 [2022-02-21 03:36:44,429 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:36:44,430 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:44,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:44,430 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:44,430 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 30 transitions. cyclomatic complexity: 10 [2022-02-21 03:36:44,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. cyclomatic complexity: 10 [2022-02-21 03:36:44,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:44,431 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:44,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:44,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:44,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:36:44,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:36:44,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:36:44,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:36:44,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:36:44,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:36:44,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:44,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:44,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:36:44,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:44,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:44,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:44,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:44,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:44,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:44,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:44,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:44,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:44,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:44,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:44,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:44,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:44,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:44,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:44,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 23 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:44,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:44,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 30 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:44,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,439 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-02-21 03:36:44,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:44,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:44,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:36:44,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:44,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. cyclomatic complexity: 10 [2022-02-21 03:36:44,442 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:44,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2022-02-21 03:36:44,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:36:44,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:36:44,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:36:44,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:44,443 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:44,443 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:44,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:44,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:36:44,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:36:44,444 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) 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:36:44,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:44,444 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:36:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:36:44,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) 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:36:44,448 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:36:44,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 03:36:44,448 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:44,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:36:44,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:36:44,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:36:44,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:36:44,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:44,449 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:44,449 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:44,449 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:44,449 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:44,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:36:44,450 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:44,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:44,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:36:44 BoogieIcfgContainer [2022-02-21 03:36:44,455 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:36:44,456 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:36:44,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:36:44,456 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:36:44,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:41" (3/4) ... [2022-02-21 03:36:44,458 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:36:44,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:36:44,459 INFO L158 Benchmark]: Toolchain (without parser) took 4006.80ms. Allocated memory was 104.9MB in the beginning and 132.1MB in the end (delta: 27.3MB). Free memory was 76.4MB in the beginning and 76.6MB in the end (delta: -234.6kB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2022-02-21 03:36:44,459 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory was 58.9MB in the beginning and 58.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:44,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.49ms. Allocated memory is still 104.9MB. Free memory was 76.4MB in the beginning and 80.8MB in the end (delta: -4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:36:44,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.59ms. Allocated memory is still 104.9MB. Free memory was 80.4MB in the beginning and 78.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:44,460 INFO L158 Benchmark]: Boogie Preprocessor took 29.74ms. Allocated memory is still 104.9MB. Free memory was 78.7MB in the beginning and 77.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:44,460 INFO L158 Benchmark]: RCFGBuilder took 308.53ms. Allocated memory is still 104.9MB. Free memory was 77.5MB in the beginning and 64.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:36:44,461 INFO L158 Benchmark]: BuchiAutomizer took 3392.32ms. Allocated memory was 104.9MB in the beginning and 132.1MB in the end (delta: 27.3MB). Free memory was 64.4MB in the beginning and 76.6MB in the end (delta: -12.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2022-02-21 03:36:44,461 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 132.1MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:44,462 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.19ms. Allocated memory is still 104.9MB. Free memory was 58.9MB in the beginning and 58.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.49ms. Allocated memory is still 104.9MB. Free memory was 76.4MB in the beginning and 80.8MB in the end (delta: -4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.59ms. Allocated memory is still 104.9MB. Free memory was 80.4MB in the beginning and 78.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.74ms. Allocated memory is still 104.9MB. Free memory was 78.7MB in the beginning and 77.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 308.53ms. Allocated memory is still 104.9MB. Free memory was 77.5MB in the beginning and 64.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3392.32ms. Allocated memory was 104.9MB in the beginning and 132.1MB in the end (delta: 27.3MB). Free memory was 64.4MB in the beginning and 76.6MB in the end (delta: -12.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 132.1MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 199999 * unknown-#length-unknown[a] + -8 * i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 199999 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 34 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital58 mio100 ax100 hnf100 lsp96 ukn92 mio100 lsp79 div100 bol100 ite100 ukn100 eq166 hnf94 smp100 dnf143 smp94 tf103 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:36:44,485 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:36:44,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE