./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array14_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array14_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a0f9dc1e3a944fe0c87fb9c3f72dec5466e715e61eb5b701f6540feca3c935ad --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:34:28,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:34:28,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:34:28,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:34:28,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:34:28,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:34:28,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:34:28,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:34:28,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:34:28,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:34:28,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:34:28,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:34:28,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:34:28,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:34:28,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:34:28,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:34:28,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:34:28,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:34:28,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:34:28,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:34:28,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:34:28,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:34:28,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:34:28,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:34:28,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:34:28,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:34:28,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:34:28,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:34:28,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:34:28,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:34:28,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:34:28,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:34:28,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:34:28,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:34:28,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:34:28,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:34:28,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:34:28,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:34:28,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:34:28,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:34:28,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:34:28,717 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:34:28,751 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:34:28,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:34:28,752 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:34:28,753 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:34:28,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:34:28,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:34:28,754 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:34:28,754 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:34:28,755 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:34:28,759 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:34:28,759 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:34:28,759 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:34:28,760 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:34:28,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:34:28,760 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:34:28,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:34:28,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:34:28,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:34:28,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:34:28,761 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:34:28,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:34:28,761 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:34:28,762 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:34:28,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:34:28,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:34:28,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:34:28,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:34:28,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:34:28,765 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:34:28,766 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 -> a0f9dc1e3a944fe0c87fb9c3f72dec5466e715e61eb5b701f6540feca3c935ad [2022-02-21 03:34:28,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:34:28,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:34:28,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:34:28,978 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:34:28,978 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:34:28,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array14_alloca.i [2022-02-21 03:34:29,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3160406/b21089d8b37d41e7bc34734cf320c3df/FLAG2621033bc [2022-02-21 03:34:29,487 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:34:29,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array14_alloca.i [2022-02-21 03:34:29,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3160406/b21089d8b37d41e7bc34734cf320c3df/FLAG2621033bc [2022-02-21 03:34:29,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3160406/b21089d8b37d41e7bc34734cf320c3df [2022-02-21 03:34:29,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:34:29,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:34:29,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:29,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:34:29,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:34:29,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:29" (1/1) ... [2022-02-21 03:34:29,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b225fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:29, skipping insertion in model container [2022-02-21 03:34:29,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:34:29" (1/1) ... [2022-02-21 03:34:29,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:34:29,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:34:29,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:29,850 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:34:29,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:34:29,922 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:34:29,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:29 WrapperNode [2022-02-21 03:34:29,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:34:29,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:29,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:34:29,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:34:29,930 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:34:29" (1/1) ... [2022-02-21 03:34:29,940 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:34:29" (1/1) ... [2022-02-21 03:34:29,970 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-02-21 03:34:29,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:34:29,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:34:29,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:34:29,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:34:29,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:29" (1/1) ... [2022-02-21 03:34:29,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:29" (1/1) ... [2022-02-21 03:34:29,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:29" (1/1) ... [2022-02-21 03:34:29,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:29" (1/1) ... [2022-02-21 03:34:29,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:29" (1/1) ... [2022-02-21 03:34:30,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:29" (1/1) ... [2022-02-21 03:34:30,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:29" (1/1) ... [2022-02-21 03:34:30,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:34:30,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:34:30,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:34:30,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:34:30,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:29" (1/1) ... [2022-02-21 03:34:30,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:30,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:30,046 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:34:30,048 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:34:30,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:34:30,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:34:30,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:34:30,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:34:30,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:34:30,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:34:30,159 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:34:30,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:34:30,344 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:34:30,349 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:34:30,349 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:34:30,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:30 BoogieIcfgContainer [2022-02-21 03:34:30,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:34:30,352 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:34:30,352 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:34:30,354 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:34:30,355 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:30,355 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:34:29" (1/3) ... [2022-02-21 03:34:30,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57cb10b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:30, skipping insertion in model container [2022-02-21 03:34:30,356 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:30,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:34:29" (2/3) ... [2022-02-21 03:34:30,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57cb10b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:34:30, skipping insertion in model container [2022-02-21 03:34:30,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:34:30,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:34:30" (3/3) ... [2022-02-21 03:34:30,358 INFO L388 chiAutomizerObserver]: Analyzing ICFG array14_alloca.i [2022-02-21 03:34:30,417 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:34:30,417 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:34:30,417 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:34:30,418 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:34:30,418 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:34:30,418 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:34:30,418 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:34:30,418 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:34:30,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:34:30,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:34:30,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:30,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:30,459 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:30,459 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:34:30,459 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:34:30,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:34:30,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:34:30,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:30,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:30,463 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:34:30,464 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:34:30,468 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; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~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;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 8#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 5#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6#L370-3true [2022-02-21 03:34:30,469 INFO L793 eck$LassoCheckResult]: Loop: 6#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13#L372true assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 6#L370-3true [2022-02-21 03:34:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:30,473 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2022-02-21 03:34:30,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:30,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46497598] [2022-02-21 03:34:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:30,589 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:30,632 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2022-02-21 03:34:30,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:30,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574055983] [2022-02-21 03:34:30,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:30,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:30,694 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:30,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:30,696 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2022-02-21 03:34:30,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:30,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959008675] [2022-02-21 03:34:30,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:30,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:30,740 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:30,789 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:31,073 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:31,074 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:31,074 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:31,074 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:31,074 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:31,075 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:31,075 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:31,075 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:31,076 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration1_Lasso [2022-02-21 03:34:31,076 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:31,076 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:31,092 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:34:31,098 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:34:31,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:31,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:31,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:31,253 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:34:31,256 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:34:31,258 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:34:31,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:34:31,263 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:34:31,266 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:34:31,269 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:34:31,561 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:34:31,564 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:34:31,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:31,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:31,568 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:34:31,575 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:34:31,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:31,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:31,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:31,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:31,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:31,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:31,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:31,588 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:34:31,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:31,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:31,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:31,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:31,626 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:34:31,627 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:34:31,628 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:34:31,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:31,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:31,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:31,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:31,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:31,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:31,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:31,678 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:34:31,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:31,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:31,684 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:34:31,686 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:34:31,688 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:34:31,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:31,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:31,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:31,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:31,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:31,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:31,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:31,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:31,739 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:34:31,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:31,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:31,741 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:34:31,743 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:34:31,743 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:34:31,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:31,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:31,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:31,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:31,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:31,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:31,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:31,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:31,781 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:34:31,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:31,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:31,783 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:31,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:34:31,788 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:34:31,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:31,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:34:31,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:31,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:31,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:31,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:34:31,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:34:31,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:31,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:31,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:31,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:31,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:31,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:34:31,820 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:34:31,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:31,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:31,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:31,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:31,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:31,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:31,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:31,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:31,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:31,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:31,878 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:31,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:34:31,886 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:34:31,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:31,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:31,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:31,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:31,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:31,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:31,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:34:31,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:31,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:31,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:31,945 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:31,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:34:31,954 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:34:31,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:34:31,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:34:31,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:34:31,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:34:31,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:34:31,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:34:31,995 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:34:32,053 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 03:34:32,054 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:34:32,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:32,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:34:32,075 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:34:32,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:34:32,111 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:34:32,133 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:34:32,133 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:34:32,134 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~arr~0#1.offset) = -4*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 1*ULTIMATE.start_main_~arr~0#1.offset Supporting invariants [] [2022-02-21 03:34:32,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:34:32,194 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:34:32,211 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);" "assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1;" [2022-02-21 03:34:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:32,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:34:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:32,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:32,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2022-02-21 03:34:32,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~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;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {25#unseeded} is VALID [2022-02-21 03:34:32,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !(main_~length~0#1 < 1); {25#unseeded} is VALID [2022-02-21 03:34:32,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#unseeded} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {25#unseeded} is VALID [2022-02-21 03:34:32,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#unseeded} assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; {25#unseeded} is VALID [2022-02-21 03:34:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:32,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:34:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:32,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:32,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:34:32,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|)))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {70#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} is VALID [2022-02-21 03:34:32,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {70#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); {70#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} is VALID [2022-02-21 03:34:32,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {70#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|))) (<= (+ |ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|)))} main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; {53#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~i~0#1|) (select |#length| |ULTIMATE.start_main_~arr~0#1.base|) (* (- 1) |ULTIMATE.start_main_~arr~0#1.offset|)))) unseeded)} is VALID [2022-02-21 03:34:32,389 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:34:32,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:32,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:34:32,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:32,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,437 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:34:32,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:32,537 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 50 transitions. Complement of second has 7 states. [2022-02-21 03:34:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:34:32,539 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:32,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:34:32,543 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:34:32,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:32,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:32,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:32,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:32,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:32,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:32,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2022-02-21 03:34:32,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:32,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:32,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:32,563 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:34:32,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:34:32,567 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:34:32,567 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:32,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:34:32,574 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:32,574 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2022-02-21 03:34:32,575 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:34:32,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:32,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:32,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:32,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:32,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:32,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:32,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:34:32,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:32,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:32,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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 35 letters. Loop has 35 letters. [2022-02-21 03:34:32,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:34:32,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:34:32,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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 15 letters. Loop has 15 letters. [2022-02-21 03:34:32,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:34:32,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:34:32,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:32,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:32,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:34:32,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:34:32,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:32,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:32,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:34:32,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:32,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:32,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:34:32,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:32,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:34:32,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:32,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:32,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:32,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:34:32,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:34:32,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:34:32,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:32,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:32,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:34:32,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:32,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:32,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:34:32,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:34:32,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:32,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:34:32,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 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:34:32,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:32,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:34:32,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,603 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:34:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:32,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:34:32,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:34:32,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:34:32,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:34:32,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:34:32,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2022-02-21 03:34:32,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:32,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2022-02-21 03:34:32,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:34:32,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:34:32,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-02-21 03:34:32,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:32,626 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:34:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-02-21 03:34:32,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:34:32,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:32,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:32,648 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:32,650 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:32,653 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:34:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:34:32,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:32,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:32,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 17 transitions. [2022-02-21 03:34:32,655 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 17 transitions. [2022-02-21 03:34:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:32,655 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:34:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:34:32,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:32,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:32,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:32,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:34:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-02-21 03:34:32,657 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:34:32,657 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:34:32,658 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:34:32,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:34:32,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:32,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:32,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:32,658 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:32,658 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:32,659 INFO L791 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 123#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~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;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 130#L367 assume !(main_~length~0#1 < 1); 124#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 125#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 126#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 127#L370-4 main_~j~0#1 := 0; 128#L378-2 [2022-02-21 03:34:32,659 INFO L793 eck$LassoCheckResult]: Loop: 128#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 129#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 128#L378-2 [2022-02-21 03:34:32,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:32,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2022-02-21 03:34:32,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:32,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309989405] [2022-02-21 03:34:32,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:32,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:34:32,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {161#true} is VALID [2022-02-21 03:34:32,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~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;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; {161#true} is VALID [2022-02-21 03:34:32,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume !(main_~length~0#1 < 1); {163#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:32,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {163#(<= 1 |ULTIMATE.start_main_~length~0#1|)} call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; {163#(<= 1 |ULTIMATE.start_main_~length~0#1|)} is VALID [2022-02-21 03:34:32,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {163#(<= 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; {164#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:34:32,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 |ULTIMATE.start_main_~length~0#1|))} assume !(main_~i~0#1 < main_~length~0#1); {162#false} is VALID [2022-02-21 03:34:32,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {162#false} main_~j~0#1 := 0; {162#false} is VALID [2022-02-21 03:34:32,717 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:34:32,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:34:32,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309989405] [2022-02-21 03:34:32,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309989405] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:34:32,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:34:32,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:34:32,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433198798] [2022-02-21 03:34:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:34:32,721 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:34:32,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:32,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2022-02-21 03:34:32,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:32,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139409387] [2022-02-21 03:34:32,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:32,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:32,743 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:32,748 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:32,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:34:32,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:34:32,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:34:32,811 INFO L87 Difference]: Start difference. First operand 12 states and 17 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:34:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:32,862 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:34:32,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:34:32,862 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:34:32,869 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:34:32,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2022-02-21 03:34:32,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:32,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2022-02-21 03:34:32,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:34:32,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:34:32,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-02-21 03:34:32,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:34:32,873 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:34:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-02-21 03:34:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-02-21 03:34:32,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:34:32,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 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:34:32,876 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 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:34:32,876 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 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:34:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:32,877 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:34:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:34:32,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:32,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:32,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 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 14 states and 19 transitions. [2022-02-21 03:34:32,882 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 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 14 states and 19 transitions. [2022-02-21 03:34:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:34:32,888 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:34:32,888 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:34:32,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:34:32,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:34:32,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:34:32,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:34:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 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:34:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 03:34:32,890 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:34:32,890 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:34:32,890 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:34:32,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:34:32,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:34:32,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:34:32,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:34:32,892 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:34:32,892 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:34:32,892 INFO L791 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~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;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 189#L367 assume !(main_~length~0#1 < 1); 183#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 184#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 185#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 190#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 192#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 191#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 186#L370-4 main_~j~0#1 := 0; 187#L378-2 [2022-02-21 03:34:32,892 INFO L793 eck$LassoCheckResult]: Loop: 187#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 188#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 187#L378-2 [2022-02-21 03:34:32,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:32,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2022-02-21 03:34:32,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:32,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664208865] [2022-02-21 03:34:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:32,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:32,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:32,930 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:32,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:32,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2022-02-21 03:34:32,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:32,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607427406] [2022-02-21 03:34:32,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:32,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:32,945 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:32,949 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:32,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:34:32,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2022-02-21 03:34:32,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:34:32,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762070575] [2022-02-21 03:34:32,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:34:32,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:34:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:32,980 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:34:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:34:33,016 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:34:33,300 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:34:33,300 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:34:33,300 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:34:33,300 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:34:33,300 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:34:33,300 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:34:33,300 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:34:33,301 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:34:33,301 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration3_Lasso [2022-02-21 03:34:33,301 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:34:33,301 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:34:33,304 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:34:33,307 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:34:33,309 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:34:33,312 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:34:33,331 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:34:33,338 INFO L158 Benchmark]: Toolchain (without parser) took 3823.86ms. Allocated memory was 83.9MB in the beginning and 123.7MB in the end (delta: 39.8MB). Free memory was 49.8MB in the beginning and 73.2MB in the end (delta: -23.4MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2022-02-21 03:34:33,343 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 40.7MB in the beginning and 40.7MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:33,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.16ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 49.7MB in the beginning and 68.9MB in the end (delta: -19.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:34:33,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.77ms. Allocated memory is still 102.8MB. Free memory was 68.9MB in the beginning and 66.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:34:33,345 INFO L158 Benchmark]: Boogie Preprocessor took 44.51ms. Allocated memory is still 102.8MB. Free memory was 66.8MB in the beginning and 65.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:34:33,345 INFO L158 Benchmark]: RCFGBuilder took 334.45ms. Allocated memory is still 102.8MB. Free memory was 65.6MB in the beginning and 54.2MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:34:33,347 INFO L158 Benchmark]: BuchiAutomizer took 2981.37ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 54.2MB in the beginning and 73.2MB in the end (delta: -19.0MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2022-02-21 03:34:33,355 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.18ms. Allocated memory is still 83.9MB. Free memory was 40.7MB in the beginning and 40.7MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.16ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 49.7MB in the beginning and 68.9MB in the end (delta: -19.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.77ms. Allocated memory is still 102.8MB. Free memory was 68.9MB in the beginning and 66.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.51ms. Allocated memory is still 102.8MB. Free memory was 66.8MB in the beginning and 65.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 334.45ms. Allocated memory is still 102.8MB. Free memory was 65.6MB in the beginning and 54.2MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2981.37ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 54.2MB in the beginning and 73.2MB in the end (delta: -19.0MB). Peak memory consumption was 26.7MB. 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:34:33,392 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!