./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 99c02e26cc69c81635e61f874ccaf79837a3339fa533477441a437bf8690e003 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:14,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:14,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:14,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:14,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:14,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:14,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:14,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:14,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:14,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:14,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:14,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:14,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:14,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:14,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:14,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:14,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:14,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:14,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:14,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:14,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:14,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:14,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:14,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:14,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:14,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:14,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:14,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:14,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:14,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:14,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:14,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:14,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:14,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:14,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:14,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:14,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:14,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:14,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:14,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:14,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:14,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:32:14,712 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:14,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:14,713 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:14,713 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:14,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:14,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:14,714 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:14,714 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:14,714 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:14,714 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:14,715 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:14,715 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:14,715 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:14,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:14,716 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:14,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:14,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:14,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:14,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:14,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:14,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:14,717 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:14,717 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:14,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:14,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:14,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:14,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:14,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:14,719 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:14,719 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99c02e26cc69c81635e61f874ccaf79837a3339fa533477441a437bf8690e003 [2022-02-21 03:32:14,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:14,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:14,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:14,928 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:14,930 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:14,931 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2022-02-21 03:32:14,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e13bb9003/50fcbea11b6a4eccae38fda5895ec103/FLAGf3627fbc1 [2022-02-21 03:32:15,426 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:15,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2022-02-21 03:32:15,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e13bb9003/50fcbea11b6a4eccae38fda5895ec103/FLAGf3627fbc1 [2022-02-21 03:32:15,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e13bb9003/50fcbea11b6a4eccae38fda5895ec103 [2022-02-21 03:32:15,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:15,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:15,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:15,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:15,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:15,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:15" (1/1) ... [2022-02-21 03:32:15,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f29d3c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:15, skipping insertion in model container [2022-02-21 03:32:15,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:15" (1/1) ... [2022-02-21 03:32:15,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:15,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:15,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:15,711 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:15,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:15,789 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:15,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:15 WrapperNode [2022-02-21 03:32:15,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:15,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:15,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:15,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:15,805 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:32:15" (1/1) ... [2022-02-21 03:32:15,813 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:32:15" (1/1) ... [2022-02-21 03:32:15,827 INFO L137 Inliner]: procedures = 110, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2022-02-21 03:32:15,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:15,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:15,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:15,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:15,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:15" (1/1) ... [2022-02-21 03:32:15,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:15" (1/1) ... [2022-02-21 03:32:15,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:15" (1/1) ... [2022-02-21 03:32:15,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:15" (1/1) ... [2022-02-21 03:32:15,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:15" (1/1) ... [2022-02-21 03:32:15,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:15" (1/1) ... [2022-02-21 03:32:15,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:15" (1/1) ... [2022-02-21 03:32:15,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:15,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:15,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:15,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:15,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:15" (1/1) ... [2022-02-21 03:32:15,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:15,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:15,873 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:32:15,892 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:32:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:15,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:15,981 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:15,982 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:16,084 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:16,088 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:16,088 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:32:16,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:16 BoogieIcfgContainer [2022-02-21 03:32:16,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:16,091 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:16,091 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:16,095 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:16,096 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:16,096 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:15" (1/3) ... [2022-02-21 03:32:16,097 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d7f066c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:16, skipping insertion in model container [2022-02-21 03:32:16,097 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:16,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:15" (2/3) ... [2022-02-21 03:32:16,097 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d7f066c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:16, skipping insertion in model container [2022-02-21 03:32:16,098 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:16,098 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:16" (3/3) ... [2022-02-21 03:32:16,099 INFO L388 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-2.i [2022-02-21 03:32:16,145 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:16,145 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:16,146 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:16,146 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:16,146 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:16,146 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:16,146 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:16,146 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:16,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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:32:16,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:32:16,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:16,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:16,182 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:16,182 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:16,182 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:16,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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:32:16,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:32:16,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:16,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:16,189 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:32:16,190 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:16,194 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem7#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 17#L551true assume !(main_~length~0#1 < 1); 12#L551-2true call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 11#L553true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 16#L554-3true [2022-02-21 03:32:16,195 INFO L793 eck$LassoCheckResult]: Loop: 16#L554-3true assume !!(main_~i~0#1 < main_~length~0#1);main_~val~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 5#L556true assume main_~val~0#1 < 0;main_~val~0#1 := 0; 6#L556-2true call write~int(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L554-2true main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 16#L554-3true [2022-02-21 03:32:16,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:16,199 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-02-21 03:32:16,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:16,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232175006] [2022-02-21 03:32:16,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:16,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:16,308 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:16,346 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:16,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2022-02-21 03:32:16,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:16,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999427141] [2022-02-21 03:32:16,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:16,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:16,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:16,393 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:16,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2022-02-21 03:32:16,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:16,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051530489] [2022-02-21 03:32:16,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:16,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:16,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:16,449 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:16,763 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:16,767 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:16,767 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:16,767 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:16,767 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:16,767 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:16,767 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:16,768 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:16,768 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration1_Lasso [2022-02-21 03:32:16,769 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:16,769 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:16,781 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:32:16,898 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:32:16,900 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:32:16,903 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:32:16,905 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:32:16,908 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:32:16,910 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:32:16,912 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:32:16,915 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:32:16,917 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:32:16,919 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:32:16,922 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:32:16,924 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:32:16,926 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:32:16,929 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:32:17,192 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:17,195 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:17,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,198 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:32:17,199 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:32:17,200 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:32:17,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:17,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,209 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:17,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:17,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,247 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:32:17,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,249 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:32:17,249 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:32:17,253 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:32:17,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:17,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:17,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,293 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:32:17,294 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:32:17,296 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:32:17,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:17,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:17,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:17,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:17,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:17,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:17,324 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:17,355 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 03:32:17,355 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:32:17,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:17,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:17,372 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:32:17,414 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:17,422 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:32:17,432 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:32:17,432 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:17,433 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_1, ULTIMATE.start_main_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc3#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [1*ULTIMATE.start_main_~arr~0#1.offset >= 0] [2022-02-21 03:32:17,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:17,510 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2022-02-21 03:32:17,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:17,545 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1);main_~val~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;" "assume main_~val~0#1 < 0;main_~val~0#1 := 0;" "call write~int(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;" [2022-02-21 03:32:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:17,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:17,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:32:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:17,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:17,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {28#unseeded} is VALID [2022-02-21 03:32:17,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem7#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {28#unseeded} is VALID [2022-02-21 03:32:17,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !(main_~length~0#1 < 1); {28#unseeded} is VALID [2022-02-21 03:32:17,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#unseeded} call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {63#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) unseeded (>= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:32:17,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {63#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) unseeded (>= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {63#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) unseeded (>= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:32:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:17,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:32:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:17,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:17,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {64#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (* (- 4) |ULTIMATE.start_main_~i~0#1|))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (>= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~length~0#1);main_~val~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {64#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (* (- 4) |ULTIMATE.start_main_~i~0#1|))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (>= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:32:17,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {64#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (* (- 4) |ULTIMATE.start_main_~i~0#1|))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (>= |ULTIMATE.start_main_~arr~0#1.offset| 0))} assume main_~val~0#1 < 0;main_~val~0#1 := 0; {64#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (* (- 4) |ULTIMATE.start_main_~i~0#1|))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (>= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:32:17,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {64#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (* (- 4) |ULTIMATE.start_main_~i~0#1|))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (>= |ULTIMATE.start_main_~arr~0#1.offset| 0))} call write~int(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {90#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (>= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:32:17,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {90#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|))) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)) (>= |ULTIMATE.start_main_~arr~0#1.offset| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {66#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~arr~0#1.base|) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (* (- 4) |ULTIMATE.start_main_~i~0#1|))))) (>= |ULTIMATE.start_main_~arr~0#1.offset| 0))} is VALID [2022-02-21 03:32:17,745 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:32:17,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:17,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:17,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:17,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,786 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:32:17,788 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:17,912 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 57 transitions. Complement of second has 9 states. [2022-02-21 03:32:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:17,912 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:17,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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:32:17,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:32:17,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:17,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:17,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:17,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:17,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:17,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:17,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 57 transitions. [2022-02-21 03:32:17,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:17,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:17,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:17,919 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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:32:17,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:32:17,921 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:32:17,922 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:17,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:17,923 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:17,923 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 57 transitions. cyclomatic complexity: 21 [2022-02-21 03:32:17,924 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:17,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:17,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:17,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:17,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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 3 letters. [2022-02-21 03:32:17,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:17,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:17,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:17,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:17,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:17,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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 40 letters. Loop has 40 letters. [2022-02-21 03:32:17,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:32:17,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 40 letters. Loop has 40 letters. [2022-02-21 03:32:17,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:32:17,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:32:17,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:32:17,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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:32:17,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:17,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:32:17,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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 3 letters. [2022-02-21 03:32:17,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:17,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:32:17,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:17,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:17,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:32:17,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:17,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:17,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:17,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:17,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:17,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:17,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:17,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:17,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:32:17,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:17,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:17,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:32:17,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:17,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:17,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:17,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:17,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:17,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:17,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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 1 letters. [2022-02-21 03:32:17,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:32:17,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:32:17,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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 3 letters. [2022-02-21 03:32:17,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:17,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:32:17,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:32:17,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:32:17,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:32:17,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:17,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:17,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:17,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:17,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:17,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:17,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 18 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:17,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:17,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:17,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,939 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-21 03:32:17,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:32:17,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:32:17,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 03:32:17,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:17,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 57 transitions. cyclomatic complexity: 21 [2022-02-21 03:32:17,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:17,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 15 states and 20 transitions. [2022-02-21 03:32:17,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:32:17,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:17,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2022-02-21 03:32:17,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:17,950 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:32:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2022-02-21 03:32:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 03:32:17,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:17,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:17,966 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:17,968 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:17,970 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-02-21 03:32:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:32:17,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:17,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:17,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 20 transitions. [2022-02-21 03:32:17,971 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 20 transitions. [2022-02-21 03:32:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:17,972 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-02-21 03:32:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:32:17,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:17,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:17,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:17,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-02-21 03:32:17,976 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:32:17,976 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:32:17,976 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:17,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:32:17,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:17,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:17,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:17,977 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:17,977 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:17,977 INFO L791 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem7#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 156#L551 assume !(main_~length~0#1 < 1); 159#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 157#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 158#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 155#L554-4 main_~j~0#1 := 0; 154#L561-3 [2022-02-21 03:32:17,977 INFO L793 eck$LassoCheckResult]: Loop: 154#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 161#L562-3 call main_#t~mem7#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 160#L562-1 assume !(main_#t~mem7#1 > 0);havoc main_#t~mem7#1; 153#L561-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 154#L561-3 [2022-02-21 03:32:17,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2022-02-21 03:32:17,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:17,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675369269] [2022-02-21 03:32:17,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:17,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:18,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {196#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {196#true} is VALID [2022-02-21 03:32:18,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem7#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {196#true} is VALID [2022-02-21 03:32:18,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume !(main_~length~0#1 < 1); {198#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:32:18,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {198#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {198#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:32:18,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {198#(<= 1 |ULTIMATE.start_main_~length~0#1|)} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {199#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:32:18,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {199#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~i~0#1 < main_~length~0#1); {197#false} is VALID [2022-02-21 03:32:18,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#false} main_~j~0#1 := 0; {197#false} is VALID [2022-02-21 03:32:18,024 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:32:18,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:18,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675369269] [2022-02-21 03:32:18,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675369269] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:18,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:18,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:32:18,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946947935] [2022-02-21 03:32:18,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:18,027 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:32:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:18,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2022-02-21 03:32:18,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:18,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654410317] [2022-02-21 03:32:18,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:18,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:18,034 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:18,038 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:18,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:18,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:32:18,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:32:18,074 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:18,115 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:32:18,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:32:18,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:18,120 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:32:18,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2022-02-21 03:32:18,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:18,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2022-02-21 03:32:18,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:32:18,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:18,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2022-02-21 03:32:18,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:18,128 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-02-21 03:32:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2022-02-21 03:32:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2022-02-21 03:32:18,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:18,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 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:32:18,130 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 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:32:18,131 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 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:32:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:18,132 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:32:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-21 03:32:18,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:18,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:18,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 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 23 transitions. [2022-02-21 03:32:18,132 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 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 23 transitions. [2022-02-21 03:32:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:18,134 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:32:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-21 03:32:18,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:18,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:18,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:18,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 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:32:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-02-21 03:32:18,137 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-02-21 03:32:18,137 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-02-21 03:32:18,137 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:32:18,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:32:18,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:32:18,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:18,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:18,139 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:18,139 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:32:18,140 INFO L791 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet5#1, main_#t~post4#1, main_#t~mem8#1, main_#t~post9#1, main_#t~mem7#1, main_#t~post6#1, main_~i~0#1, main_~j~0#1, main_~val~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~val~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 227#L551 assume !(main_~length~0#1 < 1); 231#L551-2 call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset; 229#L553 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 230#L554-3 assume !!(main_~i~0#1 < main_~length~0#1);main_~val~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 222#L556 assume !(main_~val~0#1 < 0); 223#L556-2 call write~int(main_~val~0#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 224#L554-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 234#L554-3 assume !(main_~i~0#1 < main_~length~0#1); 228#L554-4 main_~j~0#1 := 0; 226#L561-3 [2022-02-21 03:32:18,140 INFO L793 eck$LassoCheckResult]: Loop: 226#L561-3 assume !!(main_~j~0#1 < main_~length~0#1); 233#L562-3 call main_#t~mem7#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 232#L562-1 assume !(main_#t~mem7#1 > 0);havoc main_#t~mem7#1; 225#L561-2 main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 226#L561-3 [2022-02-21 03:32:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2022-02-21 03:32:18,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:18,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337347144] [2022-02-21 03:32:18,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:18,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:18,153 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:18,162 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:18,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2022-02-21 03:32:18,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:18,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988374180] [2022-02-21 03:32:18,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:18,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:18,168 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:18,172 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:18,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2022-02-21 03:32:18,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:18,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161132149] [2022-02-21 03:32:18,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:18,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:18,187 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:18,197 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:18,421 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:18,421 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:18,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:18,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:18,421 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:18,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:18,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:18,421 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:18,422 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration3_Lasso [2022-02-21 03:32:18,422 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:18,422 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:18,423 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:32:18,426 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:32:18,438 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:32:18,441 INFO L158 Benchmark]: Toolchain (without parser) took 2986.74ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 64.4MB in the beginning and 87.0MB in the end (delta: -22.5MB). Peak memory consumption was 55.3MB. Max. memory is 16.1GB. [2022-02-21 03:32:18,441 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory was 81.7MB in the beginning and 81.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:18,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.03ms. Allocated memory is still 107.0MB. Free memory was 64.3MB in the beginning and 74.1MB in the end (delta: -9.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:32:18,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.04ms. Allocated memory is still 107.0MB. Free memory was 74.1MB in the beginning and 72.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:32:18,442 INFO L158 Benchmark]: Boogie Preprocessor took 17.27ms. Allocated memory is still 107.0MB. Free memory was 72.4MB in the beginning and 71.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:32:18,443 INFO L158 Benchmark]: RCFGBuilder took 243.77ms. Allocated memory is still 107.0MB. Free memory was 71.2MB in the beginning and 59.4MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:32:18,443 INFO L158 Benchmark]: BuchiAutomizer took 2349.30ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 59.4MB in the beginning and 87.0MB in the end (delta: -27.5MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2022-02-21 03:32:18,445 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory was 81.7MB in the beginning and 81.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.03ms. Allocated memory is still 107.0MB. Free memory was 64.3MB in the beginning and 74.1MB in the end (delta: -9.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.04ms. Allocated memory is still 107.0MB. Free memory was 74.1MB in the beginning and 72.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.27ms. Allocated memory is still 107.0MB. Free memory was 72.4MB in the beginning and 71.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 243.77ms. Allocated memory is still 107.0MB. Free memory was 71.2MB in the beginning and 59.4MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2349.30ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 59.4MB in the beginning and 87.0MB in the end (delta: -27.5MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:32:18,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~arr~0#1.offset))_1 was not added to the transformula!