./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/insertion_sort-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/insertion_sort-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 295b17c4ca5a4afcf4a0f36e9026f57ef5bd93d017747132380452b1ff4662bd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:57:44,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:57:44,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:57:44,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:57:44,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:57:44,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:57:44,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:57:44,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:57:44,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:57:44,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:57:44,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:57:44,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:57:44,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:57:44,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:57:44,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:57:44,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:57:44,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:57:44,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:57:44,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:57:44,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:57:44,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:57:44,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:57:44,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:57:44,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:57:44,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:57:44,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:57:44,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:57:44,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:57:44,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:57:44,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:57:44,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:57:44,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:57:44,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:57:44,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:57:44,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:57:44,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:57:44,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:57:44,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:57:44,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:57:44,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:57:44,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:57:44,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:57:44,846 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:57:44,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:57:44,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:57:44,847 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:57:44,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:57:44,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:57:44,848 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:57:44,848 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:57:44,848 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:57:44,849 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:57:44,849 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:57:44,849 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:57:44,850 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:57:44,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:57:44,850 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:57:44,850 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:57:44,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:57:44,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:57:44,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:57:44,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:57:44,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:57:44,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:57:44,851 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:57:44,851 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:57:44,851 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:57:44,852 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:57:44,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:57:44,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:57:44,852 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:57:44,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:57:44,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:57:44,853 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:57:44,854 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 295b17c4ca5a4afcf4a0f36e9026f57ef5bd93d017747132380452b1ff4662bd [2022-02-21 03:57:45,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:57:45,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:57:45,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:57:45,100 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:57:45,101 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:57:45,102 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-1.c [2022-02-21 03:57:45,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae029169b/339f0f32915744a381742172fb35be96/FLAGb2469bdb0 [2022-02-21 03:57:45,553 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:57:45,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1.c [2022-02-21 03:57:45,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae029169b/339f0f32915744a381742172fb35be96/FLAGb2469bdb0 [2022-02-21 03:57:45,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae029169b/339f0f32915744a381742172fb35be96 [2022-02-21 03:57:45,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:57:45,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:57:45,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:57:45,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:57:45,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:57:45,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:57:45" (1/1) ... [2022-02-21 03:57:45,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e07bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:45, skipping insertion in model container [2022-02-21 03:57:45,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:57:45" (1/1) ... [2022-02-21 03:57:46,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:57:46,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:57:46,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1.c[328,341] [2022-02-21 03:57:46,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:57:46,202 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:57:46,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1.c[328,341] [2022-02-21 03:57:46,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:57:46,249 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:57:46,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:46 WrapperNode [2022-02-21 03:57:46,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:57:46,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:57:46,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:57:46,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:57:46,257 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:57:46" (1/1) ... [2022-02-21 03:57:46,273 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:57:46" (1/1) ... [2022-02-21 03:57:46,311 INFO L137 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2022-02-21 03:57:46,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:57:46,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:57:46,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:57:46,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:57:46,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:46" (1/1) ... [2022-02-21 03:57:46,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:46" (1/1) ... [2022-02-21 03:57:46,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:46" (1/1) ... [2022-02-21 03:57:46,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:46" (1/1) ... [2022-02-21 03:57:46,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:46" (1/1) ... [2022-02-21 03:57:46,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:46" (1/1) ... [2022-02-21 03:57:46,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:46" (1/1) ... [2022-02-21 03:57:46,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:57:46,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:57:46,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:57:46,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:57:46,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:46" (1/1) ... [2022-02-21 03:57:46,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:46,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:46,381 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:57:46,385 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:57:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:57:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:57:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:57:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:57:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:57:46,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:57:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:57:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:57:46,471 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:57:46,474 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:57:46,731 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:57:46,736 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:57:46,737 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-21 03:57:46,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:46 BoogieIcfgContainer [2022-02-21 03:57:46,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:57:46,739 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:57:46,739 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:57:46,742 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:57:46,743 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:46,743 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:57:45" (1/3) ... [2022-02-21 03:57:46,745 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@251f449d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:57:46, skipping insertion in model container [2022-02-21 03:57:46,745 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:46,745 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:46" (2/3) ... [2022-02-21 03:57:46,746 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@251f449d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:57:46, skipping insertion in model container [2022-02-21 03:57:46,746 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:46,746 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:46" (3/3) ... [2022-02-21 03:57:46,748 INFO L388 chiAutomizerObserver]: Analyzing ICFG insertion_sort-1.c [2022-02-21 03:57:46,801 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:57:46,801 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:57:46,801 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:57:46,801 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:57:46,802 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:57:46,802 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:57:46,802 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:57:46,802 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:57:46,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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:57:46,844 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-02-21 03:57:46,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:46,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:46,849 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:57:46,849 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:46,850 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:57:46,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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:57:46,855 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-02-21 03:57:46,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:46,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:46,856 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:57:46,856 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:46,861 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; 12#L17-3true [2022-02-21 03:57:46,862 INFO L793 eck$LassoCheckResult]: Loop: 12#L17-3true assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 16#L17-2true main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 12#L17-3true [2022-02-21 03:57:46,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:46,866 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:57:46,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:46,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354087951] [2022-02-21 03:57:46,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:46,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:46,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:47,019 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:47,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:47,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-02-21 03:57:47,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:47,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214918274] [2022-02-21 03:57:47,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:47,047 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:47,060 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:47,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:47,061 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 03:57:47,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:47,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721259159] [2022-02-21 03:57:47,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:47,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:47,079 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:47,093 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:47,480 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:57:47,481 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:57:47,481 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:57:47,482 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:57:47,482 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:57:47,482 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:47,482 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:57:47,482 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:57:47,483 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration1_Lasso [2022-02-21 03:57:47,483 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:57:47,483 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:57:47,501 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:57:47,506 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:57:47,508 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:57:47,516 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:57:47,519 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:57:47,522 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:57:47,525 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:57:47,528 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:57:47,530 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:57:47,533 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:57:47,818 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:57:47,821 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:57:47,823 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:57:47,825 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:57:47,827 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:57:47,829 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:57:47,830 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:57:48,533 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:57:48,536 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:57:48,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:48,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:48,539 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:57:48,542 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:57:48,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:48,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:48,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:48,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:48,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:48,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:48,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:48,555 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:57:48,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:48,581 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:57:48,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:48,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:48,589 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:57:48,590 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:57:48,591 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:57:48,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:48,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:48,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:48,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:48,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:48,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:48,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:48,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:48,629 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:57:48,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:48,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:48,631 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:57:48,644 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:57:48,644 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:57:48,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:48,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:48,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:48,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:48,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:48,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:48,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:48,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:48,699 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:57:48,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:48,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:48,701 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:57:48,702 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:57:48,703 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:57:48,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:48,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:48,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:48,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:48,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:48,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:48,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:48,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:48,728 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:57:48,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:48,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:48,729 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:57:48,730 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:57:48,733 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:57:48,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:48,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:48,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:48,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:48,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:48,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:48,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:48,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:48,782 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:57:48,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:48,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:48,784 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:57:48,784 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:57:48,786 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:57:48,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:48,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:48,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:48,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:48,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:48,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:48,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:48,818 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:57:48,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:48,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:48,819 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:57:48,820 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:57:48,821 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:57:48,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:48,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:48,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:48,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:48,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:48,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:48,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:48,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:48,844 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:57:48,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:48,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:48,846 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:57:48,846 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:57:48,847 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:57:48,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:48,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:48,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:48,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:48,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:48,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:48,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:48,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:48,870 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:57:48,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:48,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:48,873 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:57:48,873 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:57:48,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:48,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:48,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:48,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:48,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:48,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:48,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:48,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:48,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:48,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:48,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:48,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:48,909 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:48,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:57:48,911 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:57:48,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:48,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:48,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:48,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:48,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:48,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:48,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:48,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:48,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:57:48,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:48,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:48,949 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:48,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:57:48,951 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:57:48,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:48,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:48,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:48,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:48,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:48,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:48,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:48,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:48,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:48,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:48,990 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:48,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:57:48,992 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:57:48,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:48,998 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 03:57:48,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:48,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:49,010 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-02-21 03:57:49,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:49,027 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:57:49,089 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 03:57:49,090 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-02-21 03:57:49,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:49,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:49,093 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:49,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:57:49,095 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:57:49,120 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:57:49,121 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:57:49,121 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_1) = -4*ULTIMATE.start_main_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~#v~0#1.offset >= 0] [2022-02-21 03:57:49,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:49,182 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2022-02-21 03:57:49,189 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1;" "main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2022-02-21 03:57:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:49,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:57:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:49,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:49,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {33#unseeded} is VALID [2022-02-21 03:57:49,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {82#(and unseeded (>= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-21 03:57:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:49,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:57:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:49,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:49,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {83#(and (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~j~0#1|) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (>= |ULTIMATE.start_main_~#v~0#1.offset| 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {94#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (>= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)))} is VALID [2022-02-21 03:57:49,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {94#(and (>= oldRank0 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (>= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {85#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~j~0#1|) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))))) (>= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-21 03:57:49,305 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:57:49,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:49,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:49,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:49,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,333 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:57:49,334 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:49,388 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 45 states and 67 transitions. Complement of second has 8 states. [2022-02-21 03:57:49,389 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:57:49,389 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:49,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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:57:49,391 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-02-21 03:57:49,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:49,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:49,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:49,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:57:49,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:49,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:49,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 67 transitions. [2022-02-21 03:57:49,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:57:49,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:49,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:49,416 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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:57:49,420 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2022-02-21 03:57:49,425 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:57:49,426 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:49,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:57:49,431 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:57:49,431 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 67 transitions. cyclomatic complexity: 27 [2022-02-21 03:57:49,433 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:57:49,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:57:49,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:49,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:49,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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:57:49,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:49,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:49,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:49,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:49,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:49,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 45 letters. Loop has 45 letters. [2022-02-21 03:57:49,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:57:49,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:57:49,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 23 letters. Loop has 23 letters. [2022-02-21 03:57:49,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:57:49,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:57:49,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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:57:49,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:49,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:49,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:49,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:49,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:49,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:49,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:49,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:49,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:49,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:49,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:49,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:49,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:49,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:49,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:49,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:49,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:49,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:49,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:49,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:49,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:49,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:49,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:49,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:57:49,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:57:49,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:57:49,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:57:49,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:57:49,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:57:49,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:57:49,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:57:49,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:57:49,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:49,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:49,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:49,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:49,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:49,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:49,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:49,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:49,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:49,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:57:49,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:57:49,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:57:49,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:57:49,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:49,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:49,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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:57:49,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:57:49,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:57:49,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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:57:49,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:49,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:49,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:49,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:49,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:57:49,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:49,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:49,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:49,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:49,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:49,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:49,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:49,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:49,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:57:49,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:49,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:49,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:49,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:49,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:49,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:57:49,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:49,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:49,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:49,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:57:49,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:57:49,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:57:49,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:49,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:49,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:49,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:57:49,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:57:49,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:57:49,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:49,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:49,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:49,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:49,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:49,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:57:49,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:57:49,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:57:49,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 67 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:57:49,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,484 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:49,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:57:49,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:49,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:57:49,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:57:49,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:49,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 67 transitions. cyclomatic complexity: 27 [2022-02-21 03:57:49,495 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:57:49,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 20 states and 29 transitions. [2022-02-21 03:57:49,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:57:49,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 03:57:49,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2022-02-21 03:57:49,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:49,499 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-02-21 03:57:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2022-02-21 03:57:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 03:57:49,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:49,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 29 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:49,516 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 29 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:49,518 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:49,520 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2022-02-21 03:57:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2022-02-21 03:57:49,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:49,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:49,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 29 transitions. [2022-02-21 03:57:49,521 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 29 transitions. [2022-02-21 03:57:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:49,522 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2022-02-21 03:57:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2022-02-21 03:57:49,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:49,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:49,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:49,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2022-02-21 03:57:49,525 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-02-21 03:57:49,525 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-02-21 03:57:49,525 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:57:49,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2022-02-21 03:57:49,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:57:49,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:49,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:49,526 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:57:49,526 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:57:49,526 INFO L791 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); 161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; 165#L17-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 166#L17-4 main_~j~0#1 := 1; 156#L19-3 [2022-02-21 03:57:49,526 INFO L793 eck$LassoCheckResult]: Loop: 156#L19-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; 157#L22-5 assume !true; 158#L22-6 call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 155#L19-2 main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 156#L19-3 [2022-02-21 03:57:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:49,527 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-02-21 03:57:49,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:49,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130265920] [2022-02-21 03:57:49,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:49,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:49,537 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:49,550 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:49,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1687228, now seen corresponding path program 1 times [2022-02-21 03:57:49,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:49,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899751684] [2022-02-21 03:57:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:49,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:49,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {220#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {220#true} is VALID [2022-02-21 03:57:49,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#true} assume !true; {221#false} is VALID [2022-02-21 03:57:49,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {221#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {221#false} is VALID [2022-02-21 03:57:49,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {221#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {221#false} is VALID [2022-02-21 03:57:49,574 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:57:49,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:49,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899751684] [2022-02-21 03:57:49,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899751684] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:49,575 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:49,575 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:57:49,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685116588] [2022-02-21 03:57:49,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:49,577 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:57:49,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:49,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:57:49,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:57:49,580 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 12 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:49,591 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-02-21 03:57:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:57:49,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:49,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:49,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2022-02-21 03:57:49,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:57:49,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 25 transitions. [2022-02-21 03:57:49,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:57:49,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:57:49,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2022-02-21 03:57:49,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:49,598 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-21 03:57:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2022-02-21 03:57:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-21 03:57:49,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:49,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 25 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 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:57:49,603 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 25 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 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:57:49,603 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 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:57:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:49,604 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-21 03:57:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-21 03:57:49,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:49,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:49,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 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 19 states and 25 transitions. [2022-02-21 03:57:49,628 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 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 19 states and 25 transitions. [2022-02-21 03:57:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:49,630 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-21 03:57:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-21 03:57:49,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:49,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:49,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:49,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 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:57:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-02-21 03:57:49,636 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-21 03:57:49,636 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-21 03:57:49,636 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:57:49,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2022-02-21 03:57:49,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:57:49,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:49,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:49,639 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:57:49,639 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:57:49,639 INFO L791 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); 250#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; 251#L17-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 252#L17-4 main_~j~0#1 := 1; 245#L19-3 [2022-02-21 03:57:49,639 INFO L793 eck$LassoCheckResult]: Loop: 245#L19-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; 242#L22-5 main_#t~short10#1 := main_~i~0#1 >= 0; 243#L22-1 assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; 246#L22-3 assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; 260#L22-6 call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 244#L19-2 main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 245#L19-3 [2022-02-21 03:57:49,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2022-02-21 03:57:49,640 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:49,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300392510] [2022-02-21 03:57:49,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:49,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:49,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:49,655 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:49,664 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:49,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1602376878, now seen corresponding path program 1 times [2022-02-21 03:57:49,665 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:49,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243600421] [2022-02-21 03:57:49,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:49,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:49,688 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:49,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:49,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1970718008, now seen corresponding path program 1 times [2022-02-21 03:57:49,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:49,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410212210] [2022-02-21 03:57:49,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:49,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:49,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {306#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {306#true} is VALID [2022-02-21 03:57:49,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {308#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (* 17179869184 (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* |ULTIMATE.start_main_~SIZE~0#1| 4)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:57:49,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {308#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (* 17179869184 (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* |ULTIMATE.start_main_~SIZE~0#1| 4)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {309#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~#v~0#1.base|) 0))} is VALID [2022-02-21 03:57:49,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {309#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_main_~#v~0#1.base|) 0))} main_~j~0#1 := 1; {310#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (select |#length| |ULTIMATE.start_main_~#v~0#1.base|) 0))} is VALID [2022-02-21 03:57:49,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {310#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (select |#length| |ULTIMATE.start_main_~#v~0#1.base|) 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {307#false} is VALID [2022-02-21 03:57:49,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#false} main_#t~short10#1 := main_~i~0#1 >= 0; {307#false} is VALID [2022-02-21 03:57:49,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {307#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {307#false} is VALID [2022-02-21 03:57:49,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {307#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {307#false} is VALID [2022-02-21 03:57:49,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {307#false} is VALID [2022-02-21 03:57:49,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {307#false} is VALID [2022-02-21 03:57:49,822 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:57:49,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:49,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410212210] [2022-02-21 03:57:49,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410212210] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:49,823 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:49,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:57:49,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037231372] [2022-02-21 03:57:49,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:49,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:49,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:57:49,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:57:49,980 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:50,111 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-02-21 03:57:50,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:57:50,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:50,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:50,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2022-02-21 03:57:50,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:57:50,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 25 transitions. [2022-02-21 03:57:50,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:57:50,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:57:50,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2022-02-21 03:57:50,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:50,125 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 03:57:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2022-02-21 03:57:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-21 03:57:50,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:50,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 25 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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:57:50,126 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 25 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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:57:50,126 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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:57:50,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:50,127 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-02-21 03:57:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-02-21 03:57:50,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:50,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:50,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 25 transitions. [2022-02-21 03:57:50,127 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 25 transitions. [2022-02-21 03:57:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:50,128 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-02-21 03:57:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-02-21 03:57:50,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:50,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:50,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:50,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 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:57:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-02-21 03:57:50,130 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-21 03:57:50,130 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-21 03:57:50,130 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:57:50,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2022-02-21 03:57:50,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:57:50,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:50,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:50,131 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:57:50,131 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:57:50,131 INFO L791 eck$LassoCheckResult]: Stem: 344#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); 345#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; 346#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 347#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 348#L17-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 349#L17-4 main_~j~0#1 := 1; 340#L19-3 [2022-02-21 03:57:50,131 INFO L793 eck$LassoCheckResult]: Loop: 340#L19-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; 337#L22-5 main_#t~short10#1 := main_~i~0#1 >= 0; 338#L22-1 assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; 341#L22-3 assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; 355#L22-6 call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 339#L19-2 main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 340#L19-3 [2022-02-21 03:57:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:50,132 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-02-21 03:57:50,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:50,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741226377] [2022-02-21 03:57:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:50,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:50,145 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:50,156 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1602376878, now seen corresponding path program 2 times [2022-02-21 03:57:50,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:50,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309205733] [2022-02-21 03:57:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:50,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:50,167 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:50,175 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1315520442, now seen corresponding path program 1 times [2022-02-21 03:57:50,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:50,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308562544] [2022-02-21 03:57:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:50,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:50,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {403#true} is VALID [2022-02-21 03:57:50,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {403#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {405#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:57:50,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {405#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:57:50,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {405#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {406#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (not (<= (+ (div |ULTIMATE.start_main_~j~0#1| 4294967296) 1) 0)) (or (<= |ULTIMATE.start_main_~j~0#1| 1) (and (<= |ULTIMATE.start_main_~j~0#1| 4294967297) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))))))} is VALID [2022-02-21 03:57:50,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {406#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (not (<= (+ (div |ULTIMATE.start_main_~j~0#1| 4294967296) 1) 0)) (or (<= |ULTIMATE.start_main_~j~0#1| 1) (and (<= |ULTIMATE.start_main_~j~0#1| 4294967297) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))))))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {407#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1)) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} is VALID [2022-02-21 03:57:50,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {407#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1)) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} main_~j~0#1 := 1; {408#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1)) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} is VALID [2022-02-21 03:57:50,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {408#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1)) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {404#false} is VALID [2022-02-21 03:57:50,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {404#false} main_#t~short10#1 := main_~i~0#1 >= 0; {404#false} is VALID [2022-02-21 03:57:50,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {404#false} is VALID [2022-02-21 03:57:50,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {404#false} is VALID [2022-02-21 03:57:50,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {404#false} is VALID [2022-02-21 03:57:50,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {404#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {404#false} is VALID [2022-02-21 03:57:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:50,466 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:50,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308562544] [2022-02-21 03:57:50,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308562544] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:57:50,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875812794] [2022-02-21 03:57:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:50,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:50,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:50,468 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:57:50,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 03:57:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:50,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:57:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:50,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:50,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {403#true} is VALID [2022-02-21 03:57:50,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {403#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {415#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:57:50,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {415#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {415#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:57:50,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {415#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {422#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-21 03:57:50,588 INFO L290 TraceCheckUtils]: 4: Hoare triple {422#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {426#(not (< 1 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-21 03:57:50,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {426#(not (< 1 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} main_~j~0#1 := 1; {430#(and (not (< 1 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:57:50,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {430#(and (not (< 1 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {404#false} is VALID [2022-02-21 03:57:50,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {404#false} main_#t~short10#1 := main_~i~0#1 >= 0; {404#false} is VALID [2022-02-21 03:57:50,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {404#false} is VALID [2022-02-21 03:57:50,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {404#false} is VALID [2022-02-21 03:57:50,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {404#false} is VALID [2022-02-21 03:57:50,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {404#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {404#false} is VALID [2022-02-21 03:57:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:50,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:57:50,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {404#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {404#false} is VALID [2022-02-21 03:57:50,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {404#false} is VALID [2022-02-21 03:57:50,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {404#false} is VALID [2022-02-21 03:57:50,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {404#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {404#false} is VALID [2022-02-21 03:57:50,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {404#false} main_#t~short10#1 := main_~i~0#1 >= 0; {404#false} is VALID [2022-02-21 03:57:50,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(not (< (mod |ULTIMATE.start_main_~j~0#1| 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {404#false} is VALID [2022-02-21 03:57:50,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {426#(not (< 1 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} main_~j~0#1 := 1; {464#(not (< (mod |ULTIMATE.start_main_~j~0#1| 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-21 03:57:50,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {471#(<= (div (+ (* (- 1) (mod |ULTIMATE.start_main_~j~0#1| 4294967296)) 1) (- 4294967296)) 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {426#(not (< 1 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-21 03:57:50,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {475#(<= (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) 1) (- 4294967296)) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {471#(<= (div (+ (* (- 1) (mod |ULTIMATE.start_main_~j~0#1| 4294967296)) 1) (- 4294967296)) 0)} is VALID [2022-02-21 03:57:50,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {475#(<= (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) 1) (- 4294967296)) 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {475#(<= (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) 1) (- 4294967296)) 0)} is VALID [2022-02-21 03:57:50,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {403#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {475#(<= (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) 1) (- 4294967296)) 0)} is VALID [2022-02-21 03:57:50,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {403#true} is VALID [2022-02-21 03:57:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:50,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875812794] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:57:50,949 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:57:50,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-02-21 03:57:50,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284017997] [2022-02-21 03:57:50,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:57:51,100 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:51,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:57:51,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:57:51,101 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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:57:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:51,566 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-21 03:57:51,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:57:51,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 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:57:51,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:51,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2022-02-21 03:57:51,592 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2022-02-21 03:57:51,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 44 transitions. [2022-02-21 03:57:51,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-02-21 03:57:51,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-02-21 03:57:51,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2022-02-21 03:57:51,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:51,603 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-02-21 03:57:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2022-02-21 03:57:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2022-02-21 03:57:51,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:51,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states and 44 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:51,605 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states and 44 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:51,605 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:51,606 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-02-21 03:57:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-02-21 03:57:51,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:51,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:51,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 35 states and 44 transitions. [2022-02-21 03:57:51,606 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 35 states and 44 transitions. [2022-02-21 03:57:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:51,607 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-02-21 03:57:51,607 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-02-21 03:57:51,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:51,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:51,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:51,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-02-21 03:57:51,609 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-02-21 03:57:51,609 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-02-21 03:57:51,609 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:57:51,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2022-02-21 03:57:51,609 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:57:51,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:51,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:51,610 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2022-02-21 03:57:51,610 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:57:51,610 INFO L791 eck$LassoCheckResult]: Stem: 532#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); 533#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; 534#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 535#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 536#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 537#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 545#L17-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 540#L17-4 main_~j~0#1 := 1; 528#L19-3 [2022-02-21 03:57:51,610 INFO L793 eck$LassoCheckResult]: Loop: 528#L19-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; 525#L22-5 main_#t~short10#1 := main_~i~0#1 >= 0; 526#L22-1 assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; 529#L22-3 assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; 544#L22-6 call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 527#L19-2 main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 528#L19-3 [2022-02-21 03:57:51,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:51,611 INFO L85 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2022-02-21 03:57:51,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:51,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962357817] [2022-02-21 03:57:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:51,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:51,645 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1602376878, now seen corresponding path program 3 times [2022-02-21 03:57:51,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:51,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628874650] [2022-02-21 03:57:51,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:51,653 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:51,658 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:51,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1264115268, now seen corresponding path program 2 times [2022-02-21 03:57:51,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:51,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684731597] [2022-02-21 03:57:51,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:51,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:51,690 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:52,093 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:57:52,093 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:57:52,093 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:57:52,093 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:57:52,093 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:57:52,093 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:52,093 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:57:52,093 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:57:52,093 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration5_Lasso [2022-02-21 03:57:52,093 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:57:52,094 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:57:52,095 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:57:52,097 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:57:52,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:52,100 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:57:52,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:57:52,104 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:57:52,105 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:57:52,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:57:52,408 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:57:52,409 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:57:52,413 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:57:52,415 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:57:52,416 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:57:52,418 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:57:52,419 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:57:52,421 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:57:52,422 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:57:52,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:52,899 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:57:52,899 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:57:52,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:52,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:52,900 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:52,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:57:52,953 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:57:52,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:52,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:52,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:52,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:52,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:52,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:52,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:52,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:52,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:52,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:52,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:52,992 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:52,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:57:52,994 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:57:53,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:57:53,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,024 INFO L229 MonitoredProcess]: Starting monitored process 18 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:57:53,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:57:53,028 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:57:53,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,053 INFO L229 MonitoredProcess]: Starting monitored process 19 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:57:53,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:57:53,055 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:57:53,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,091 INFO L229 MonitoredProcess]: Starting monitored process 20 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:57:53,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:57:53,095 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:57:53,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,119 INFO L229 MonitoredProcess]: Starting monitored process 21 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:57:53,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:57:53,127 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:57:53,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,155 INFO L229 MonitoredProcess]: Starting monitored process 22 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:57:53,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:57:53,157 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:57:53,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,190 INFO L229 MonitoredProcess]: Starting monitored process 23 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:57:53,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:57:53,193 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:57:53,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:57:53,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,234 INFO L229 MonitoredProcess]: Starting monitored process 24 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:57:53,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:57:53,239 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:57:53,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:57:53,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,266 INFO L229 MonitoredProcess]: Starting monitored process 25 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:57:53,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:57:53,268 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:57:53,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,297 INFO L229 MonitoredProcess]: Starting monitored process 26 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:57:53,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:57:53,300 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:57:53,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,312 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:57:53,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,329 INFO L229 MonitoredProcess]: Starting monitored process 27 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:57:53,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:57:53,331 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:57:53,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:57:53,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,364 INFO L229 MonitoredProcess]: Starting monitored process 28 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:57:53,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:57:53,366 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:57:53,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,392 INFO L229 MonitoredProcess]: Starting monitored process 29 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:57:53,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:57:53,394 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:57:53,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,422 INFO L229 MonitoredProcess]: Starting monitored process 30 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:57:53,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:57:53,424 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:57:53,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:57:53,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,463 INFO L229 MonitoredProcess]: Starting monitored process 31 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:57:53,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:57:53,465 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:57:53,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,514 INFO L229 MonitoredProcess]: Starting monitored process 32 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:57:53,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:57:53,517 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:57:53,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 03:57:53,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,552 INFO L229 MonitoredProcess]: Starting monitored process 33 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:57:53,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:57:53,554 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:57:53,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,601 INFO L229 MonitoredProcess]: Starting monitored process 34 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:57:53,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:57:53,603 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:57:53,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:57:53,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,640 INFO L229 MonitoredProcess]: Starting monitored process 35 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:57:53,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:57:53,652 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:57:53,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 03:57:53,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,678 INFO L229 MonitoredProcess]: Starting monitored process 36 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:57:53,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:57:53,679 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:57:53,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:53,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:53,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:53,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:53,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 03:57:53,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,703 INFO L229 MonitoredProcess]: Starting monitored process 37 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:57:53,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:57:53,705 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:57:53,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:53,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:53,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:53,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:53,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:53,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:53,725 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:57:53,734 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:57:53,734 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-02-21 03:57:53,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:53,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,735 INFO L229 MonitoredProcess]: Starting monitored process 38 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:57:53,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:57:53,737 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:57:53,744 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:57:53,744 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:57:53,744 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_2 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-02-21 03:57:53,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:53,821 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2022-02-21 03:57:53,826 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1;" "main_#t~short10#1 := main_~i~0#1 >= 0;" "assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1;" "assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;" "call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);" "main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;" [2022-02-21 03:57:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:53,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:57:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:53,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:53,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {625#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {625#unseeded} is VALID [2022-02-21 03:57:53,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:53,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:53,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:53,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:53,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:53,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:53,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} main_~j~0#1 := 1; {714#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:53,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:57:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:53,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:53,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~j~0#1|) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {744#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (<= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)))} is VALID [2022-02-21 03:57:53,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {744#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (<= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)))} main_#t~short10#1 := main_~i~0#1 >= 0; {744#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (<= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)))} is VALID [2022-02-21 03:57:53,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {744#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (<= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {744#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (<= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)))} is VALID [2022-02-21 03:57:53,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {744#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (<= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {744#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (<= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)))} is VALID [2022-02-21 03:57:53,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {744#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (<= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {744#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (<= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)))} is VALID [2022-02-21 03:57:53,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {744#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))) (<= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {717#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~j~0#1|) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))))))} is VALID [2022-02-21 03:57:53,984 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:57:53,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:57:53,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:53,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 6 letters. [2022-02-21 03:57:53,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:53,993 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:57:53,993 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:57:54,056 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 47 transitions. Complement of second has 7 states. [2022-02-21 03:57:54,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:57:54,057 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:54,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. cyclomatic complexity: 8 [2022-02-21 03:57:54,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:54,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:54,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:57:54,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:57:54,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:54,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:54,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2022-02-21 03:57:54,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:54,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:54,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:54,059 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 26 transitions. cyclomatic complexity: 8 [2022-02-21 03:57:54,060 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:57:54,060 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:57:54,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:57:54,061 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:57:54,061 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 47 transitions. cyclomatic complexity: 17 [2022-02-21 03:57:54,062 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:57:54,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:57:54,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 6 letters. [2022-02-21 03:57:54,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:57:54,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:54,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:57:54,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:54,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:57:54,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:57:54,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:57:54,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:57:54,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 21 letters. Loop has 21 letters. [2022-02-21 03:57:54,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:57:54,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:54,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:57:54,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:57:54,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:54,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:54,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:54,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:54,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:54,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:54,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:57:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:57:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:57:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:57:54,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 6 letters. [2022-02-21 03:57:54,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:57:54,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:57:54,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:57:54,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:57:54,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:54,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:54,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:54,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:57:54,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:57:54,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:57:54,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:54,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:54,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:54,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:57:54,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:57:54,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:57:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:57:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:57:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:57:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:57:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:57:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:57:54,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:57:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:57:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:57:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:57:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:57:54,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:57:54,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:57:54,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:57:54,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:57:54,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:57:54,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:54,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:54,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:54,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 47 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:54,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,083 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:57:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-02-21 03:57:54,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:57:54,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:57:54,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 8 letters. Loop has 12 letters. [2022-02-21 03:57:54,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:54,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. cyclomatic complexity: 17 [2022-02-21 03:57:54,086 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:54,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 38 transitions. [2022-02-21 03:57:54,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:57:54,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:57:54,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2022-02-21 03:57:54,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:57:54,086 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-02-21 03:57:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2022-02-21 03:57:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-02-21 03:57:54,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:54,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 38 transitions. Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 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:57:54,088 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 38 transitions. Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 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:57:54,088 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 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:57:54,088 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:54,089 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-02-21 03:57:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-02-21 03:57:54,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:54,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:54,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states and 38 transitions. [2022-02-21 03:57:54,090 INFO L87 Difference]: Start difference. First operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states and 38 transitions. [2022-02-21 03:57:54,090 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:54,091 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-02-21 03:57:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-21 03:57:54,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:54,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:54,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:54,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 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:57:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-02-21 03:57:54,092 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-02-21 03:57:54,092 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-02-21 03:57:54,092 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:57:54,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2022-02-21 03:57:54,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:54,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:54,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:54,093 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:57:54,093 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:57:54,093 INFO L791 eck$LassoCheckResult]: Stem: 817#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); 818#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; 819#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 820#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 821#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 822#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 833#L17-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 823#L17-4 main_~j~0#1 := 1; 824#L19-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; 807#L22-5 [2022-02-21 03:57:54,093 INFO L793 eck$LassoCheckResult]: Loop: 807#L22-5 main_#t~short10#1 := main_~i~0#1 >= 0; 808#L22-1 assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; 813#L22-3 assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; 830#L23 assume main_~i~0#1 < 2;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1; 828#L23-2 main_~i~0#1 := main_~i~0#1 - 1; 807#L22-5 [2022-02-21 03:57:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash -367607191, now seen corresponding path program 1 times [2022-02-21 03:57:54,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:54,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101560118] [2022-02-21 03:57:54,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,107 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,114 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:54,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 1 times [2022-02-21 03:57:54,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:54,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405239973] [2022-02-21 03:57:54,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:54,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,120 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,123 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:54,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:54,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1264113600, now seen corresponding path program 1 times [2022-02-21 03:57:54,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:54,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94718331] [2022-02-21 03:57:54,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:54,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,149 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:54,162 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:54,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:54,653 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:57:54,653 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:57:54,653 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:57:54,653 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:57:54,653 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:57:54,653 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:54,653 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:57:54,653 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:57:54,653 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration6_Lasso [2022-02-21 03:57:54,653 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:57:54,653 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:57:54,655 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:57:54,661 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:57:54,664 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:57:54,666 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:57:54,668 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:57:54,670 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:57:54,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:54,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:54,676 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:57:54,678 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:57:54,680 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:57:54,682 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:57:54,684 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:57:55,188 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:57:55,192 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:57:55,196 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:57:55,199 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:57:55,201 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:57:55,695 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:57:55,695 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:57:55,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:55,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:55,697 INFO L229 MonitoredProcess]: Starting monitored process 39 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:57:55,703 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:57:55,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:57:55,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:55,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:55,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:55,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:55,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:55,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:55,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:55,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:55,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:55,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:55,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:55,741 INFO L229 MonitoredProcess]: Starting monitored process 40 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:57:55,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:57:55,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:57:55,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:55,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:55,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:55,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:55,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:55,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:55,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:55,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:55,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:55,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:55,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:55,778 INFO L229 MonitoredProcess]: Starting monitored process 41 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:57:55,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:57:55,780 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:57:55,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:55,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:55,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:55,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:55,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:55,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:55,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:55,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-02-21 03:57:55,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:55,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:55,816 INFO L229 MonitoredProcess]: Starting monitored process 42 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:57:55,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:57:55,818 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:57:55,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:55,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:55,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:55,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:55,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:55,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:55,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:55,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:55,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:57:55,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:55,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:55,858 INFO L229 MonitoredProcess]: Starting monitored process 43 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:57:55,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:57:55,860 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:57:55,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:55,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:55,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:55,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:55,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:55,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:55,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:55,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:55,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:57:55,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:55,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:55,908 INFO L229 MonitoredProcess]: Starting monitored process 44 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:57:55,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:57:55,910 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:57:55,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:55,916 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:55,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:55,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:55,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:55,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:55,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:55,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:55,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:57:55,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:55,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:55,948 INFO L229 MonitoredProcess]: Starting monitored process 45 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:57:55,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:57:55,950 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:57:55,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:55,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:55,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:55,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:55,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:55,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:55,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:55,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:55,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:55,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:55,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:55,990 INFO L229 MonitoredProcess]: Starting monitored process 46 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:57:55,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:57:55,992 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:57:55,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:55,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:55,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:55,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:55,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:55,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:55,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:55,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 03:57:56,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,016 INFO L229 MonitoredProcess]: Starting monitored process 47 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:57:56,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:57:56,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:56,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:56,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:56,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:56,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:56,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,042 INFO L229 MonitoredProcess]: Starting monitored process 48 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:57:56,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:57:56,045 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:57:56,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:56,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:56,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:56,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 03:57:56,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,084 INFO L229 MonitoredProcess]: Starting monitored process 49 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:57:56,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:57:56,086 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:57:56,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:56,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:56,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:56,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:56,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,124 INFO L229 MonitoredProcess]: Starting monitored process 50 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:57:56,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:57:56,126 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:57:56,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:56,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:56,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:56,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-02-21 03:57:56,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,157 INFO L229 MonitoredProcess]: Starting monitored process 51 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:57:56,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:57:56,159 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:57:56,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,169 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 03:57:56,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,186 INFO L229 MonitoredProcess]: Starting monitored process 52 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:57:56,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:57:56,188 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:57:56,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,198 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:56,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,215 INFO L229 MonitoredProcess]: Starting monitored process 53 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:57:56,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:57:56,217 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:57:56,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-02-21 03:57:56,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,261 INFO L229 MonitoredProcess]: Starting monitored process 54 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:57:56,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:57:56,263 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:57:56,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-02-21 03:57:56,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,296 INFO L229 MonitoredProcess]: Starting monitored process 55 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:57:56,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 03:57:56,298 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:57:56,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:56,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,364 INFO L229 MonitoredProcess]: Starting monitored process 56 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:57:56,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 03:57:56,367 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:57:56,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-02-21 03:57:56,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,411 INFO L229 MonitoredProcess]: Starting monitored process 57 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:57:56,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 03:57:56,413 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:57:56,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-02-21 03:57:56,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,453 INFO L229 MonitoredProcess]: Starting monitored process 58 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:57:56,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 03:57:56,455 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:57:56,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-02-21 03:57:56,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,490 INFO L229 MonitoredProcess]: Starting monitored process 59 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:57:56,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 03:57:56,492 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:57:56,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:56,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:56,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,528 INFO L229 MonitoredProcess]: Starting monitored process 60 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:57:56,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 03:57:56,530 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:57:56,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:56,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:56,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:56,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:56,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:56,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:56,551 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:57:56,572 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-02-21 03:57:56,572 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-02-21 03:57:56,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:56,574 INFO L229 MonitoredProcess]: Starting monitored process 61 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:57:56,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 03:57:56,575 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:57:56,582 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:57:56,582 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:57:56,582 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~j~0#1 + 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:57:56,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-02-21 03:57:56,666 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2022-02-21 03:57:56,671 INFO L390 LassoCheck]: Loop: "main_#t~short10#1 := main_~i~0#1 >= 0;" "assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1;" "assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;" "assume main_~i~0#1 < 2;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1;" "main_~i~0#1 := main_~i~0#1 - 1;" [2022-02-21 03:57:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:56,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:57:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:56,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:56,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {969#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {969#unseeded} is VALID [2022-02-21 03:57:56,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {969#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {969#unseeded} is VALID [2022-02-21 03:57:56,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {969#unseeded} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {969#unseeded} is VALID [2022-02-21 03:57:56,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {969#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {969#unseeded} is VALID [2022-02-21 03:57:56,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {969#unseeded} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {969#unseeded} is VALID [2022-02-21 03:57:56,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {969#unseeded} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {969#unseeded} is VALID [2022-02-21 03:57:56,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {969#unseeded} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {969#unseeded} is VALID [2022-02-21 03:57:56,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {969#unseeded} main_~j~0#1 := 1; {1063#(and unseeded (= (+ 4 |ULTIMATE.start_main_~#v~0#1.offset|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)))} is VALID [2022-02-21 03:57:56,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {1063#(and unseeded (= (+ 4 |ULTIMATE.start_main_~#v~0#1.offset|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {1063#(and unseeded (= (+ 4 |ULTIMATE.start_main_~#v~0#1.offset|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)))} is VALID [2022-02-21 03:57:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:56,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:57:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:56,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:56,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#(and (>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= (+ 4 |ULTIMATE.start_main_~#v~0#1.offset|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)))} main_#t~short10#1 := main_~i~0#1 >= 0; {1096#(and (>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (or (and |ULTIMATE.start_main_#t~short10#1| (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (not |ULTIMATE.start_main_#t~short10#1|))))} is VALID [2022-02-21 03:57:56,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#(and (>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (or (and |ULTIMATE.start_main_#t~short10#1| (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (not |ULTIMATE.start_main_#t~short10#1|))))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {1100#(and (>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:57:56,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {1100#(and (>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1100#(and (>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:57:56,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {1100#(and (>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 < 2;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1; {1100#(and (>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:57:56,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {1100#(and (>= oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|))) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_~i~0#1 := main_~i~0#1 - 1; {1066#(and (or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)))) unseeded) (= (+ 4 |ULTIMATE.start_main_~#v~0#1.offset|) (+ (* |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)))} is VALID [2022-02-21 03:57:56,844 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:57:56,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:57:56,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:56,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:56,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,854 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:57:56,854 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 37 transitions. cyclomatic complexity: 14 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:57:56,973 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 37 transitions. cyclomatic complexity: 14. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 63 states and 84 transitions. Complement of second has 10 states. [2022-02-21 03:57:56,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:57:56,974 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:56,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. cyclomatic complexity: 14 [2022-02-21 03:57:56,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:56,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:56,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:57:56,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:57:56,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:56,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:56,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 84 transitions. [2022-02-21 03:57:56,976 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-02-21 03:57:56,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:56,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:56,976 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 37 transitions. cyclomatic complexity: 14 [2022-02-21 03:57:56,977 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:57:56,977 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:57:56,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:57:56,978 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:57:56,978 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 63 states and 84 transitions. cyclomatic complexity: 28 [2022-02-21 03:57:56,979 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:57:56,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:56,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:56,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:56,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:57:56,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:57:56,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:57:56,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:56,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:56,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:56,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 63 letters. Loop has 63 letters. [2022-02-21 03:57:56,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 63 letters. Loop has 63 letters. [2022-02-21 03:57:56,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 63 letters. Loop has 63 letters. [2022-02-21 03:57:56,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:57:56,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:57:56,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:57:56,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:57:56,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:57:56,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:57:56,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:56,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:56,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:57,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:57,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:57,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:57,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 5 letters. [2022-02-21 03:57:57,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:57:57,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:57:57,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:57:57,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:57:57,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:57:57,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:57:57,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:57:57,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:57:57,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:57:57,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:57,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:57,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:57,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:57:57,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:57:57,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:57:57,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:57:57,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 19 letters. Loop has 5 letters. [2022-02-21 03:57:57,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:57:57,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:57:57,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:57:57,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:57:57,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:57:57,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:57:57,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:57:57,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:57:57,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:57:57,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:57:57,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:57:57,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:57:57,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:57:57,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:57:57,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 19 letters. Loop has 4 letters. [2022-02-21 03:57:57,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:57:57,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:57,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:57,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:57,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:57:57,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:57:57,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:57:57,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:57:57,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:57:57,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:57:57,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:57,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:57,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:57:57,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:57,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:57,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:57,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:57,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:57,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:57,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:57,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:57,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 84 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:57:57,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,012 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:57:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-02-21 03:57:57,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:57:57,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 14 letters. Loop has 5 letters. [2022-02-21 03:57:57,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 9 letters. Loop has 10 letters. [2022-02-21 03:57:57,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:57,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 84 transitions. cyclomatic complexity: 28 [2022-02-21 03:57:57,019 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-02-21 03:57:57,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 45 states and 58 transitions. [2022-02-21 03:57:57,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 03:57:57,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 03:57:57,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2022-02-21 03:57:57,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:57:57,021 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2022-02-21 03:57:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2022-02-21 03:57:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-02-21 03:57:57,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:57,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 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:57:57,023 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 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:57:57,023 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 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:57:57,024 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:57,025 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-21 03:57:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-02-21 03:57:57,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:57,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:57,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 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 45 states and 58 transitions. [2022-02-21 03:57:57,026 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 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 45 states and 58 transitions. [2022-02-21 03:57:57,026 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:57,028 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-02-21 03:57:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-02-21 03:57:57,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:57,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:57,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:57,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 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:57:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2022-02-21 03:57:57,042 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2022-02-21 03:57:57,042 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2022-02-21 03:57:57,042 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:57:57,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 47 transitions. [2022-02-21 03:57:57,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:57,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:57,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:57,043 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:57,043 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:57:57,043 INFO L791 eck$LassoCheckResult]: Stem: 1196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); 1197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; 1202#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 1203#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1204#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 1205#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1218#L17-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 1208#L17-4 main_~j~0#1 := 1; 1209#L19-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 1206#L19-4 main_~k~0#1 := 1; 1207#L29-3 [2022-02-21 03:57:57,044 INFO L793 eck$LassoCheckResult]: Loop: 1207#L29-3 assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1210#L6 assume !(0 == __VERIFIER_assert_~cond#1); 1200#L6-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1;havoc main_#t~mem14#1; 1201#L29-2 main_#t~post12#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 1207#L29-3 [2022-02-21 03:57:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1489078962, now seen corresponding path program 1 times [2022-02-21 03:57:57,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:57,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452570390] [2022-02-21 03:57:57,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:57,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:57,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:57,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {1408#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {1408#true} is VALID [2022-02-21 03:57:57,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {1408#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {1410#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (* 17179869184 (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* |ULTIMATE.start_main_~SIZE~0#1| 4)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:57:57,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {1410#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (* 17179869184 (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* |ULTIMATE.start_main_~SIZE~0#1| 4)) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1410#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (* 17179869184 (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* |ULTIMATE.start_main_~SIZE~0#1| 4)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:57:57,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {1410#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (* 17179869184 (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* |ULTIMATE.start_main_~SIZE~0#1| 4)) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1411#(and (<= (+ (* 17179869184 (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|) 4) (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* |ULTIMATE.start_main_~j~0#1| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-21 03:57:57,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {1411#(and (<= (+ (* 17179869184 (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|) 4) (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* |ULTIMATE.start_main_~j~0#1| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} is VALID [2022-02-21 03:57:57,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} is VALID [2022-02-21 03:57:57,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} is VALID [2022-02-21 03:57:57,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} main_~j~0#1 := 1; {1413#(and (<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} is VALID [2022-02-21 03:57:57,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {1413#(and (<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1409#false} is VALID [2022-02-21 03:57:57,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {1409#false} main_~k~0#1 := 1; {1409#false} is VALID [2022-02-21 03:57:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:57,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:57,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452570390] [2022-02-21 03:57:57,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452570390] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:57:57,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500151044] [2022-02-21 03:57:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:57,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:57,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:57,134 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:57:57,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-02-21 03:57:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:57,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:57:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:57,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:57,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {1408#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {1408#true} is VALID [2022-02-21 03:57:57,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {1408#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {1420#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:57:57,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {1420#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1420#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:57:57,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {1420#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1427#(= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:57:57,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {1427#(= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} is VALID [2022-02-21 03:57:57,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} is VALID [2022-02-21 03:57:57,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} is VALID [2022-02-21 03:57:57,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} main_~j~0#1 := 1; {1413#(and (<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} is VALID [2022-02-21 03:57:57,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {1413#(and (<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1409#false} is VALID [2022-02-21 03:57:57,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {1409#false} main_~k~0#1 := 1; {1409#false} is VALID [2022-02-21 03:57:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:57,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:57:57,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {1409#false} main_~k~0#1 := 1; {1409#false} is VALID [2022-02-21 03:57:57,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {1449#(< (mod |ULTIMATE.start_main_~j~0#1| 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1409#false} is VALID [2022-02-21 03:57:57,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} main_~j~0#1 := 1; {1449#(< (mod |ULTIMATE.start_main_~j~0#1| 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))} is VALID [2022-02-21 03:57:57,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} is VALID [2022-02-21 03:57:57,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} is VALID [2022-02-21 03:57:57,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {1462#(<= (div (+ (- 1) (mod |ULTIMATE.start_main_~j~0#1| 4294967296)) (- 4294967296)) 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1412#(<= (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)} is VALID [2022-02-21 03:57:57,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {1466#(<= (div (+ (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) (- 4294967296)) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1462#(<= (div (+ (- 1) (mod |ULTIMATE.start_main_~j~0#1| 4294967296)) (- 4294967296)) 0)} is VALID [2022-02-21 03:57:57,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#(<= (div (+ (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) (- 4294967296)) 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1466#(<= (div (+ (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) (- 4294967296)) 0)} is VALID [2022-02-21 03:57:57,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {1408#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {1466#(<= (div (+ (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) (- 4294967296)) 0)} is VALID [2022-02-21 03:57:57,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {1408#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {1408#true} is VALID [2022-02-21 03:57:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:57,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500151044] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:57:57,723 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:57:57,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 03:57:57,724 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156105919] [2022-02-21 03:57:57,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:57:57,724 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:57,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:57,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2931530, now seen corresponding path program 1 times [2022-02-21 03:57:57,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:57,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585570441] [2022-02-21 03:57:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:57,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:57,733 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:57,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:57:57,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:57:57,836 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:58,356 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-02-21 03:57:58,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:57:58,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:58,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:58,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2022-02-21 03:57:58,377 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-02-21 03:57:58,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 60 transitions. [2022-02-21 03:57:58,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-02-21 03:57:58,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-02-21 03:57:58,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 60 transitions. [2022-02-21 03:57:58,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:57:58,378 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 60 transitions. [2022-02-21 03:57:58,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 60 transitions. [2022-02-21 03:57:58,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-02-21 03:57:58,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:58,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 60 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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:57:58,381 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 60 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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:57:58,381 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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:57:58,381 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:58,393 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-02-21 03:57:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-02-21 03:57:58,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:58,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:58,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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 45 states and 60 transitions. [2022-02-21 03:57:58,395 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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 45 states and 60 transitions. [2022-02-21 03:57:58,395 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:58,396 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-02-21 03:57:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-02-21 03:57:58,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:58,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:58,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:58,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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:57:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-02-21 03:57:58,398 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-02-21 03:57:58,398 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-02-21 03:57:58,398 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:57:58,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2022-02-21 03:57:58,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:58,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:58,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:58,399 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:58,399 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:57:58,400 INFO L791 eck$LassoCheckResult]: Stem: 1546#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); 1547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; 1551#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 1552#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1553#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 1554#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1566#L17-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 1555#L17-4 main_~j~0#1 := 1; 1556#L19-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; 1562#L22-5 main_#t~short10#1 := main_~i~0#1 >= 0; 1549#L22-1 assume !main_#t~short10#1; 1550#L22-3 assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; 1565#L22-6 call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1542#L19-2 main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1543#L19-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; 1538#L22-5 [2022-02-21 03:57:58,400 INFO L793 eck$LassoCheckResult]: Loop: 1538#L22-5 main_#t~short10#1 := main_~i~0#1 >= 0; 1539#L22-1 assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; 1548#L22-3 assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; 1563#L23 assume main_~i~0#1 < 2;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1; 1560#L23-2 main_~i~0#1 := main_~i~0#1 - 1; 1538#L22-5 [2022-02-21 03:57:58,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash -531020578, now seen corresponding path program 1 times [2022-02-21 03:57:58,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:58,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395789342] [2022-02-21 03:57:58,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:58,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {1760#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {1760#true} is VALID [2022-02-21 03:57:58,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {1760#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {1760#true} is VALID [2022-02-21 03:57:58,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {1760#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1760#true} is VALID [2022-02-21 03:57:58,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {1760#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1760#true} is VALID [2022-02-21 03:57:58,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {1760#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1760#true} is VALID [2022-02-21 03:57:58,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {1760#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1760#true} is VALID [2022-02-21 03:57:58,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {1760#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1760#true} is VALID [2022-02-21 03:57:58,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {1760#true} main_~j~0#1 := 1; {1762#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-21 03:57:58,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {1762#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {1763#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-21 03:57:58,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {1763#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~short10#1 := main_~i~0#1 >= 0; {1764#|ULTIMATE.start_main_#t~short10#1|} is VALID [2022-02-21 03:57:58,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {1764#|ULTIMATE.start_main_#t~short10#1|} assume !main_#t~short10#1; {1761#false} is VALID [2022-02-21 03:57:58,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {1761#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1761#false} is VALID [2022-02-21 03:57:58,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {1761#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1761#false} is VALID [2022-02-21 03:57:58,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {1761#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1761#false} is VALID [2022-02-21 03:57:58,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {1761#false} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {1761#false} is VALID [2022-02-21 03:57:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:57:58,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:58,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395789342] [2022-02-21 03:57:58,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395789342] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:58,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:58,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:57:58,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12866769] [2022-02-21 03:57:58,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:58,453 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:58,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:58,453 INFO L85 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 2 times [2022-02-21 03:57:58,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:58,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769221813] [2022-02-21 03:57:58,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:58,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:58,471 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:58,479 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:58,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:58,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:57:58,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:57:58,590 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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:57:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:58,712 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-02-21 03:57:58,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:57:58,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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:57:58,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:58,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2022-02-21 03:57:58,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:58,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2022-02-21 03:57:58,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 03:57:58,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:57:58,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2022-02-21 03:57:58,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:57:58,724 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 59 transitions. [2022-02-21 03:57:58,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2022-02-21 03:57:58,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-02-21 03:57:58,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:58,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 59 transitions. Second operand has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 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:57:58,726 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 59 transitions. Second operand has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 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:57:58,726 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 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:57:58,726 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:58,727 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-02-21 03:57:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2022-02-21 03:57:58,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:58,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:58,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 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 45 states and 59 transitions. [2022-02-21 03:57:58,727 INFO L87 Difference]: Start difference. First operand has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 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 45 states and 59 transitions. [2022-02-21 03:57:58,728 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:58,728 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-02-21 03:57:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2022-02-21 03:57:58,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:58,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:58,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:58,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 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:57:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-02-21 03:57:58,730 INFO L704 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-02-21 03:57:58,730 INFO L587 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-02-21 03:57:58,730 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:57:58,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 50 transitions. [2022-02-21 03:57:58,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:58,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:58,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:58,730 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:58,730 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:57:58,730 INFO L791 eck$LassoCheckResult]: Stem: 1825#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); 1826#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; 1827#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 1828#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1829#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 1830#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 1835#L17-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 1831#L17-4 main_~j~0#1 := 1; 1832#L19-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; 1816#L22-5 main_#t~short10#1 := main_~i~0#1 >= 0; 1818#L22-1 assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; 1822#L22-3 assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; 1842#L22-6 call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1819#L19-2 main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1820#L19-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; 1814#L22-5 [2022-02-21 03:57:58,730 INFO L793 eck$LassoCheckResult]: Loop: 1814#L22-5 main_#t~short10#1 := main_~i~0#1 >= 0; 1815#L22-1 assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; 1821#L22-3 assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; 1840#L23 assume main_~i~0#1 < 2;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1; 1837#L23-2 main_~i~0#1 := main_~i~0#1 - 1; 1814#L22-5 [2022-02-21 03:57:58,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:58,731 INFO L85 PathProgramCache]: Analyzing trace with hash -532867620, now seen corresponding path program 3 times [2022-02-21 03:57:58,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:58,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779126298] [2022-02-21 03:57:58,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:58,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:59,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {2033#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {2033#true} is VALID [2022-02-21 03:57:59,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {2033#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {2035#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:57:59,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {2035#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2035#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:57:59,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {2035#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2036#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|) (or (<= |ULTIMATE.start_main_~j~0#1| 1) (and (<= |ULTIMATE.start_main_~j~0#1| 4294967297) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))))))} is VALID [2022-02-21 03:57:59,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {2036#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|) (or (<= |ULTIMATE.start_main_~j~0#1| 1) (and (<= |ULTIMATE.start_main_~j~0#1| 4294967297) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))))))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2036#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|) (or (<= |ULTIMATE.start_main_~j~0#1| 1) (and (<= |ULTIMATE.start_main_~j~0#1| 4294967297) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))))))} is VALID [2022-02-21 03:57:59,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {2036#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|) (or (<= |ULTIMATE.start_main_~j~0#1| 1) (and (<= |ULTIMATE.start_main_~j~0#1| 4294967297) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))))))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2037#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (not (<= (+ (div |ULTIMATE.start_main_~j~0#1| 4294967296) 1) 0)) (or (<= |ULTIMATE.start_main_~j~0#1| 2) (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (<= |ULTIMATE.start_main_~j~0#1| 4294967298))))} is VALID [2022-02-21 03:57:59,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {2037#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (not (<= (+ (div |ULTIMATE.start_main_~j~0#1| 4294967296) 1) 0)) (or (<= |ULTIMATE.start_main_~j~0#1| 2) (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (<= |ULTIMATE.start_main_~j~0#1| 4294967298))))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2038#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} is VALID [2022-02-21 03:57:59,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {2038#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} main_~j~0#1 := 1; {2039#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} is VALID [2022-02-21 03:57:59,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {2039#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2039#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} is VALID [2022-02-21 03:57:59,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {2039#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} main_#t~short10#1 := main_~i~0#1 >= 0; {2039#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} is VALID [2022-02-21 03:57:59,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {2039#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {2039#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} is VALID [2022-02-21 03:57:59,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {2039#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2039#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} is VALID [2022-02-21 03:57:59,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {2039#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2039#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} is VALID [2022-02-21 03:57:59,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {2039#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2040#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (or (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~j~0#1| 4294967296)) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))) (<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~j~0#1|))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-21 03:57:59,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {2040#(and (or (and (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (- 17179869184) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0)) (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (* |ULTIMATE.start_main_~SIZE~0#1| 4) (* (- 1) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (* (- 17179869184) (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) 0))) (or (and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~j~0#1| 4294967296)) (not (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2147483647 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))))) (<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~j~0#1|))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2034#false} is VALID [2022-02-21 03:57:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:59,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:59,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779126298] [2022-02-21 03:57:59,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779126298] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:57:59,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922605894] [2022-02-21 03:57:59,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:57:59,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:59,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:59,085 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:57:59,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-02-21 03:57:59,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-21 03:57:59,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:57:59,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:57:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:59,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:59,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {2033#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {2033#true} is VALID [2022-02-21 03:57:59,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {2033#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {2047#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:57:59,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {2047#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2047#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:57:59,328 INFO L290 TraceCheckUtils]: 3: Hoare triple {2047#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2054#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-21 03:57:59,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {2054#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2054#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-21 03:57:59,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {2054#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2061#(= (+ (- 2) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-21 03:57:59,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {2061#(= (+ (- 2) |ULTIMATE.start_main_~j~0#1|) 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2065#(not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-21 03:57:59,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#(not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} main_~j~0#1 := 1; {2069#(and (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:57:59,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {2069#(and (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2069#(and (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:57:59,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {2069#(and (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} main_#t~short10#1 := main_~i~0#1 >= 0; {2069#(and (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:57:59,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {2069#(and (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {2069#(and (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:57:59,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {2069#(and (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2069#(and (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:57:59,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {2069#(and (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2069#(and (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:57:59,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {2069#(and (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))) (= |ULTIMATE.start_main_~j~0#1| 1))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2088#(and (= 2 |ULTIMATE.start_main_~j~0#1|) (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))))} is VALID [2022-02-21 03:57:59,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {2088#(and (= 2 |ULTIMATE.start_main_~j~0#1|) (not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296))))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2034#false} is VALID [2022-02-21 03:57:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:59,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:57:59,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {2092#(not (< (mod |ULTIMATE.start_main_~j~0#1| 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2034#false} is VALID [2022-02-21 03:57:59,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {2096#(not (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2092#(not (< (mod |ULTIMATE.start_main_~j~0#1| 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-21 03:57:59,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {2096#(not (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2096#(not (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-21 03:57:59,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {2096#(not (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2096#(not (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-21 03:57:59,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {2096#(not (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {2096#(not (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-21 03:57:59,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {2096#(not (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} main_#t~short10#1 := main_~i~0#1 >= 0; {2096#(not (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-21 03:57:59,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {2096#(not (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2096#(not (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-21 03:57:59,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#(not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} main_~j~0#1 := 1; {2096#(not (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-21 03:57:59,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {2118#(<= (div (+ (* (- 1) (mod |ULTIMATE.start_main_~j~0#1| 4294967296)) 2) (- 4294967296)) 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2065#(not (< 2 (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-21 03:57:59,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {2122#(<= (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) 2) (- 4294967296)) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2118#(<= (div (+ (* (- 1) (mod |ULTIMATE.start_main_~j~0#1| 4294967296)) 2) (- 4294967296)) 0)} is VALID [2022-02-21 03:57:59,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {2122#(<= (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) 2) (- 4294967296)) 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2122#(<= (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) 2) (- 4294967296)) 0)} is VALID [2022-02-21 03:57:59,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {2129#(<= (div (+ 2 (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~j~0#1|) 4294967296))) (- 4294967296)) 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2122#(<= (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) 2) (- 4294967296)) 0)} is VALID [2022-02-21 03:57:59,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(<= (div (+ 2 (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~j~0#1|) 4294967296))) (- 4294967296)) 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2129#(<= (div (+ 2 (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~j~0#1|) 4294967296))) (- 4294967296)) 0)} is VALID [2022-02-21 03:57:59,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {2033#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {2129#(<= (div (+ 2 (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~j~0#1|) 4294967296))) (- 4294967296)) 0)} is VALID [2022-02-21 03:57:59,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {2033#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {2033#true} is VALID [2022-02-21 03:57:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:59,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922605894] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:57:59,665 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:57:59,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-02-21 03:57:59,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789695022] [2022-02-21 03:57:59,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:57:59,666 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:59,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:59,667 INFO L85 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 3 times [2022-02-21 03:57:59,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:59,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112832406] [2022-02-21 03:57:59,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:59,691 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:59,694 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:59,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:59,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:57:59,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:57:59,780 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. cyclomatic complexity: 18 Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 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:58:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:58:00,639 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2022-02-21 03:58:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:58:00,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 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:58:00,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:00,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 106 transitions. [2022-02-21 03:58:00,684 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2022-02-21 03:58:00,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 106 transitions. [2022-02-21 03:58:00,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-02-21 03:58:00,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-02-21 03:58:00,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 106 transitions. [2022-02-21 03:58:00,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:58:00,685 INFO L681 BuchiCegarLoop]: Abstraction has 80 states and 106 transitions. [2022-02-21 03:58:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 106 transitions. [2022-02-21 03:58:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2022-02-21 03:58:00,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:58:00,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states and 106 transitions. Second operand has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 53 states have internal predecessors, (73), 0 states have call successors, (0), 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:58:00,687 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states and 106 transitions. Second operand has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 53 states have internal predecessors, (73), 0 states have call successors, (0), 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:58:00,687 INFO L87 Difference]: Start difference. First operand 80 states and 106 transitions. Second operand has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 53 states have internal predecessors, (73), 0 states have call successors, (0), 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:58:00,687 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:00,692 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2022-02-21 03:58:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2022-02-21 03:58:00,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:00,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:00,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 53 states have internal predecessors, (73), 0 states have call successors, (0), 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 80 states and 106 transitions. [2022-02-21 03:58:00,694 INFO L87 Difference]: Start difference. First operand has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 53 states have internal predecessors, (73), 0 states have call successors, (0), 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 80 states and 106 transitions. [2022-02-21 03:58:00,694 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:00,695 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2022-02-21 03:58:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2022-02-21 03:58:00,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:00,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:00,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:58:00,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:58:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 53 states have internal predecessors, (73), 0 states have call successors, (0), 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:58:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-02-21 03:58:00,700 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-02-21 03:58:00,700 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-02-21 03:58:00,700 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:58:00,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. [2022-02-21 03:58:00,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:58:00,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:00,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:00,700 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:58:00,700 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:58:00,701 INFO L791 eck$LassoCheckResult]: Stem: 2239#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); 2240#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; 2241#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 2242#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2243#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 2244#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2268#L17-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 2269#L17-4 main_~j~0#1 := 1; 2272#L19-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; 2271#L22-5 main_#t~short10#1 := main_~i~0#1 >= 0; 2260#L22-1 assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; 2259#L22-3 assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; 2256#L22-6 call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 2226#L19-2 main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 2227#L19-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 2245#L19-4 main_~k~0#1 := 1; 2246#L29-3 [2022-02-21 03:58:00,701 INFO L793 eck$LassoCheckResult]: Loop: 2246#L29-3 assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2249#L6 assume !(0 == __VERIFIER_assert_~cond#1); 2237#L6-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1;havoc main_#t~mem14#1; 2238#L29-2 main_#t~post12#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; 2246#L29-3 [2022-02-21 03:58:00,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash 660972959, now seen corresponding path program 1 times [2022-02-21 03:58:00,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:00,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36969488] [2022-02-21 03:58:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:00,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,740 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,769 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:00,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2931530, now seen corresponding path program 2 times [2022-02-21 03:58:00,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:00,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368358957] [2022-02-21 03:58:00,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:00,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,778 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,791 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:00,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:00,791 INFO L85 PathProgramCache]: Analyzing trace with hash 183132648, now seen corresponding path program 1 times [2022-02-21 03:58:00,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:00,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420344439] [2022-02-21 03:58:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,826 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:00,852 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:01,611 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:01,611 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:01,611 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:01,611 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:01,611 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:58:01,611 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:01,611 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:01,611 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:01,611 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration10_Lasso [2022-02-21 03:58:01,611 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:01,611 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:01,614 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:58:01,618 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:58:01,620 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:58:01,622 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:58:01,624 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:58:01,626 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:58:01,628 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:58:01,630 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:58:02,138 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:58:02,140 WARN L259 bleTransFormulaUtils]: 2 quantified variables [2022-02-21 03:58:02,146 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:58:02,148 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:58:02,149 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:58:02,151 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:58:02,152 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:58:02,154 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:58:02,156 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:58:02,163 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:58:02,749 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:58:02,750 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:58:02,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:02,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:02,751 INFO L229 MonitoredProcess]: Starting monitored process 64 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:58:02,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 03:58:02,753 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:58:02,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:02,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:02,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:02,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:02,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:02,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:02,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:02,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:02,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-02-21 03:58:02,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:02,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:02,801 INFO L229 MonitoredProcess]: Starting monitored process 65 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:58:02,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-02-21 03:58:02,804 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:58:02,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:02,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:02,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:02,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:02,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:02,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:02,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:02,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:02,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-02-21 03:58:02,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:02,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:02,848 INFO L229 MonitoredProcess]: Starting monitored process 66 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:58:02,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 03:58:02,850 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:58:02,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:02,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:02,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:02,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:02,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:02,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:02,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:02,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:02,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-02-21 03:58:02,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:02,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:02,886 INFO L229 MonitoredProcess]: Starting monitored process 67 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:58:02,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 03:58:02,889 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:58:02,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:02,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:02,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:02,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:02,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:02,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:02,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:02,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:02,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-02-21 03:58:02,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:02,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:02,926 INFO L229 MonitoredProcess]: Starting monitored process 68 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:58:02,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 03:58:02,928 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:58:02,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:02,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:02,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:02,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:02,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:02,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:02,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:02,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:02,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-02-21 03:58:02,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:02,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:02,975 INFO L229 MonitoredProcess]: Starting monitored process 69 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:58:02,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 03:58:02,977 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:58:02,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:02,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:02,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:02,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:02,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:02,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:02,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:03,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-02-21 03:58:03,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,015 INFO L229 MonitoredProcess]: Starting monitored process 70 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:58:03,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-02-21 03:58:03,048 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:58:03,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:03,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:58:03,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:03,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:03,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:03,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:58:03,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:58:03,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:03,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-02-21 03:58:03,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,091 INFO L229 MonitoredProcess]: Starting monitored process 71 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:58:03,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-02-21 03:58:03,094 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:58:03,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:03,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:03,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:03,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:03,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:03,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:03,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:03,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-02-21 03:58:03,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,130 INFO L229 MonitoredProcess]: Starting monitored process 72 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:58:03,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-02-21 03:58:03,132 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:58:03,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:03,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:03,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:03,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:03,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:03,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:03,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:03,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-02-21 03:58:03,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,180 INFO L229 MonitoredProcess]: Starting monitored process 73 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:58:03,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-02-21 03:58:03,182 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:58:03,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:03,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:03,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:03,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:03,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:03,192 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:03,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:03,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-02-21 03:58:03,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,216 INFO L229 MonitoredProcess]: Starting monitored process 74 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:58:03,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-02-21 03:58:03,220 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:58:03,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:03,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:03,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:03,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:03,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:03,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:03,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:03,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-02-21 03:58:03,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,258 INFO L229 MonitoredProcess]: Starting monitored process 75 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:58:03,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-02-21 03:58:03,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:58:03,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:03,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:03,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:03,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:03,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:03,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:03,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:03,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-02-21 03:58:03,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,288 INFO L229 MonitoredProcess]: Starting monitored process 76 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:58:03,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-02-21 03:58:03,290 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:58:03,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:03,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:03,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:03,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:03,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:03,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:03,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:03,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-02-21 03:58:03,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,326 INFO L229 MonitoredProcess]: Starting monitored process 77 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:58:03,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-02-21 03:58:03,327 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:58:03,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:03,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:03,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:03,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:03,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:03,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:03,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:03,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-02-21 03:58:03,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,376 INFO L229 MonitoredProcess]: Starting monitored process 78 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:58:03,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-02-21 03:58:03,417 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:58:03,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:03,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:03,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:03,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:03,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:03,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:03,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:03,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-02-21 03:58:03,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,454 INFO L229 MonitoredProcess]: Starting monitored process 79 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:58:03,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-02-21 03:58:03,456 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:58:03,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:03,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:03,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:03,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:03,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:03,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:03,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:58:03,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-02-21 03:58:03,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,497 INFO L229 MonitoredProcess]: Starting monitored process 80 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:58:03,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-02-21 03:58:03,499 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:58:03,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:58:03,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:58:03,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:58:03,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:58:03,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:58:03,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:58:03,526 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:58:03,541 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-02-21 03:58:03,541 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:58:03,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:03,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:58:03,542 INFO L229 MonitoredProcess]: Starting monitored process 81 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:58:03,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-02-21 03:58:03,544 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:58:03,553 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:58:03,553 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:58:03,553 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_4, ULTIMATE.start_main_~k~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0#1.base)_4 - 4*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2022-02-21 03:58:03,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-02-21 03:58:03,656 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2022-02-21 03:58:03,661 INFO L390 LassoCheck]: Loop: "assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" "assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1;havoc main_#t~mem14#1;" "main_#t~post12#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1;" [2022-02-21 03:58:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:03,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:03,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:58:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:03,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:03,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {2588#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); {2588#unseeded} is VALID [2022-02-21 03:58:03,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {2588#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} main_~j~0#1 := 1; {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} main_#t~short10#1 := main_~i~0#1 >= 0; {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} main_~k~0#1 := 1; {2712#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) unseeded)} is VALID [2022-02-21 03:58:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:03,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:58:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:58:03,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:58:03,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {2713#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~k~0#1|) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2766#(and (<= (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~k~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))))} is VALID [2022-02-21 03:58:03,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {2766#(and (<= (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~k~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))))} assume !(0 == __VERIFIER_assert_~cond#1); {2766#(and (<= (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~k~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))))} is VALID [2022-02-21 03:58:03,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {2766#(and (<= (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~k~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {2766#(and (<= (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~k~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))))} is VALID [2022-02-21 03:58:03,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {2766#(and (<= (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (>= oldRank0 (+ (* |ULTIMATE.start_main_~k~0#1| (- 4)) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))))} main_#t~post12#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2715#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~k~0#1|) (select |#length| |ULTIMATE.start_main_~#v~0#1.base|))))))} is VALID [2022-02-21 03:58:03,854 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:58:03,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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:58:03,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:58:03,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,865 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:58:03,865 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 73 transitions. cyclomatic complexity: 25 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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:58:03,916 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states and 73 transitions. cyclomatic complexity: 25. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 58 states and 78 transitions. Complement of second has 5 states. [2022-02-21 03:58:03,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:58:03,916 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:03,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. cyclomatic complexity: 25 [2022-02-21 03:58:03,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:03,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:03,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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:58:03,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:03,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:03,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:03,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 78 transitions. [2022-02-21 03:58:03,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:58:03,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:03,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:03,918 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 54 states and 73 transitions. cyclomatic complexity: 25 [2022-02-21 03:58:03,918 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:58:03,919 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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:58:03,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:58:03,922 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:58:03,922 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 78 transitions. cyclomatic complexity: 26 [2022-02-21 03:58:03,923 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:58:03,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:03,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:58:03,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:03,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:58:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:58:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:58:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 58 letters. Loop has 58 letters. [2022-02-21 03:58:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 58 letters. Loop has 58 letters. [2022-02-21 03:58:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 58 letters. Loop has 58 letters. [2022-02-21 03:58:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:58:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 54 letters. Loop has 54 letters. [2022-02-21 03:58:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 54 letters. Loop has 54 letters. [2022-02-21 03:58:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:58:03,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:58:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:58:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:58:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:58:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:58:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:58:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:58:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:58:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 5 letters. [2022-02-21 03:58:03,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 21 letters. Loop has 5 letters. [2022-02-21 03:58:03,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 21 letters. Loop has 5 letters. [2022-02-21 03:58:03,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:58:03,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 19 letters. Loop has 5 letters. [2022-02-21 03:58:03,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:58:03,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:58:03,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 20 letters. Loop has 5 letters. [2022-02-21 03:58:03,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:58:03,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:58:03,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:58:03,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:58:03,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:58:03,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:58:03,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:58:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:58:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 19 letters. Loop has 4 letters. [2022-02-21 03:58:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:58:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 2 letters. [2022-02-21 03:58:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:58:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:58:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:58:03,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 18 letters. Loop has 5 letters. [2022-02-21 03:58:03,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:58:03,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 19 letters. Loop has 5 letters. [2022-02-21 03:58:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 19 letters. Loop has 5 letters. [2022-02-21 03:58:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:58:03,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 20 letters. Loop has 5 letters. [2022-02-21 03:58:03,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 20 letters. Loop has 5 letters. [2022-02-21 03:58:03,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 5 letters. [2022-02-21 03:58:03,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 21 letters. Loop has 5 letters. [2022-02-21 03:58:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 21 letters. Loop has 5 letters. [2022-02-21 03:58:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:58:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:58:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 78 transitions. cyclomatic complexity: 26 Stem has 17 letters. Loop has 5 letters. [2022-02-21 03:58:03,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,938 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:58:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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:58:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-02-21 03:58:03,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:58:03,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 20 letters. Loop has 4 letters. [2022-02-21 03:58:03,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 16 letters. Loop has 8 letters. [2022-02-21 03:58:03,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:58:03,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 78 transitions. cyclomatic complexity: 26 [2022-02-21 03:58:03,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:58:03,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 34 states and 46 transitions. [2022-02-21 03:58:03,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:58:03,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:58:03,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 46 transitions. [2022-02-21 03:58:03,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:58:03,953 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-02-21 03:58:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 46 transitions. [2022-02-21 03:58:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-21 03:58:03,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:58:03,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 46 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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:58:03,963 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 46 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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:58:03,963 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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:58:03,963 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:03,964 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-02-21 03:58:03,964 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-02-21 03:58:03,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:03,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:03,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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 34 states and 46 transitions. [2022-02-21 03:58:03,964 INFO L87 Difference]: Start difference. First operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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 34 states and 46 transitions. [2022-02-21 03:58:03,965 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:58:03,967 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-02-21 03:58:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-02-21 03:58:03,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:03,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:58:03,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:58:03,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:58:03,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:58:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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:58:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-02-21 03:58:03,983 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-02-21 03:58:03,983 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-02-21 03:58:03,983 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 03:58:03,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2022-02-21 03:58:03,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:58:03,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:58:03,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:58:03,983 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:58:03,983 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:58:03,984 INFO L791 eck$LassoCheckResult]: Stem: 2851#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3); 2852#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; 2853#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 2854#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2855#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 2856#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2870#L17-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; 2868#L17-2 main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 2867#L17-3 assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); 2857#L17-4 main_~j~0#1 := 1; 2858#L19-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; 2865#L22-5 main_#t~short10#1 := main_~i~0#1 >= 0; 2875#L22-1 assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; 2869#L22-3 assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; 2866#L22-6 call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); 2847#L19-2 main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 2848#L19-3 assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; 2843#L22-5 [2022-02-21 03:58:03,984 INFO L793 eck$LassoCheckResult]: Loop: 2843#L22-5 main_#t~short10#1 := main_~i~0#1 >= 0; 2844#L22-1 assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; 2849#L22-3 assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; 2861#L23 assume main_~i~0#1 < 2;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1; 2859#L23-2 main_~i~0#1 := main_~i~0#1 - 1; 2843#L22-5 [2022-02-21 03:58:03,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:03,984 INFO L85 PathProgramCache]: Analyzing trace with hash -610476902, now seen corresponding path program 4 times [2022-02-21 03:58:03,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:03,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425592434] [2022-02-21 03:58:03,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:03,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:04,005 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:04,018 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:04,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:04,019 INFO L85 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 4 times [2022-02-21 03:58:04,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:04,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139882682] [2022-02-21 03:58:04,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:04,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:04,025 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:04,028 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:58:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2021573807, now seen corresponding path program 1 times [2022-02-21 03:58:04,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:58:04,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605344527] [2022-02-21 03:58:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:58:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:58:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:04,051 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:58:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:58:04,067 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:58:05,171 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:58:05,171 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:58:05,171 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:58:05,171 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:58:05,171 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:58:05,171 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:58:05,171 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:58:05,171 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:58:05,171 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration11_Lasso [2022-02-21 03:58:05,171 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:58:05,171 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:58:05,173 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:58:05,175 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:58:05,177 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:58:05,179 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:58:05,181 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:58:05,182 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:58:05,184 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:58:05,186 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:58:05,188 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:58:05,189 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:58:05,191 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:58:05,193 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:58:05,787 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_~#v~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~#v~0#1.offset (- 8)))_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:111) 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:58:05,794 INFO L158 Benchmark]: Toolchain (without parser) took 19807.74ms. Allocated memory was 102.8MB in the beginning and 226.5MB in the end (delta: 123.7MB). Free memory was 71.7MB in the beginning and 161.8MB in the end (delta: -90.1MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2022-02-21 03:58:05,795 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:58:05,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.90ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 71.5MB in the beginning and 104.4MB in the end (delta: -32.9MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-02-21 03:58:05,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.05ms. Allocated memory is still 130.0MB. Free memory was 103.9MB in the beginning and 102.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:58:05,795 INFO L158 Benchmark]: Boogie Preprocessor took 40.35ms. Allocated memory is still 130.0MB. Free memory was 102.3MB in the beginning and 101.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:58:05,796 INFO L158 Benchmark]: RCFGBuilder took 384.81ms. Allocated memory is still 130.0MB. Free memory was 101.1MB in the beginning and 87.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:58:05,796 INFO L158 Benchmark]: BuchiAutomizer took 19053.74ms. Allocated memory was 130.0MB in the beginning and 226.5MB in the end (delta: 96.5MB). Free memory was 87.1MB in the beginning and 161.8MB in the end (delta: -74.8MB). Peak memory consumption was 116.1MB. Max. memory is 16.1GB. [2022-02-21 03:58:05,797 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 102.8MB. Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.90ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 71.5MB in the beginning and 104.4MB in the end (delta: -32.9MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.05ms. Allocated memory is still 130.0MB. Free memory was 103.9MB in the beginning and 102.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.35ms. Allocated memory is still 130.0MB. Free memory was 102.3MB in the beginning and 101.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 384.81ms. Allocated memory is still 130.0MB. Free memory was 101.1MB in the beginning and 87.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 19053.74ms. Allocated memory was 130.0MB in the beginning and 226.5MB in the end (delta: 96.5MB). Free memory was 87.1MB in the beginning and 161.8MB in the end (delta: -74.8MB). Peak memory consumption was 116.1MB. 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_~#v~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~#v~0#1.offset (- 8)))_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_~#v~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~#v~0#1.offset (- 8)))_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:58:05,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:06,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-02-21 03:58:06,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-02-21 03:58:06,414 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*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_main_~#v~0#1.base) (+ (* ULTIMATE.start_main_~j~0#1 4) ULTIMATE.start_main_~#v~0#1.offset (- 8)))_1 was not added to the transformula!